A136572 → basis A013611 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-3 + 4\,x + 4\,n\right)\,P_{n}(x) = \left(n + 8\,n x + 16\,n x^{2} + 4\,n^{2} + 16\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 5 | 4 | 9 | |||||||||||||
| 2 | 18 | 80 | 32 | 130 | ||||||||||||
| 3 | 78 | 648 | 1440 | 384 | 2550 | |||||||||||
| 4 | 408 | 4992 | 20736 | 30720 | 6144 | 63000 | ||||||||||
| 5 | 2520 | 40800 | 249600 | 691200 | 768000 | 122880 | 1875000 | |||||||||
| 6 | 18000 | 362880 | 2937600 | 11980800 | 24883200 | 22118400 | 2949120 | 65250000 | ||||||||
| 7 | 146160 | 3528000 | 35562240 | 191923200 | 587059200 | 975421440 | 722534400 | 82575360 | 2598750000 | |||||||
| 8 | 1330560 | 37416960 | 451584000 | 3034644480 | 12283084800 | 30057431040 | 41617981440 | 26424115200 | 2642411520 | 116550000000 | ||||||
| 9 | 13426560 | 431101440 | 6061547520 | 48771072000 | 245806202880 | 795943895040 | 1623101276160 | 1926317998080 | 1070176665600 | 95126814720 | 5811750000000 | |||||
| 10 | 148780800 | 5370624000 | 86220288000 | 808206336000 | 4877107200000 | 19664496230400 | 53062926336000 | 92748644352000 | 96315899904000 | 47563407360000 | 3805072588800 | 318937500000000 | ||||
| 11 | 1796256000 | 72009907200 | 1299691008000 | 13910206464000 | 97792966656000 | 472103976960000 | 1586269362585600 | 3668922335232000 | 5611292983296000 | 5179655061504000 | 2302068916224000 | 167423193907200 | 19100812500000000 | |||
| 12 | 23471078400 | 1034643456000 | 20738853273600 | 249540673536000 | 2003069730816000 | 11265749758771200 | 45321981788160000 | 130527307549900800 | 264162408136704000 | 359122750930944000 | 298348131542630400 | 120544699613184000 | 8036313307545600 | 1239603750000000000 | ||
| 13 | 330032102400 | 15866448998400 | 349709488128000 | 4673154937651200 | 42172373827584000 | 270815027606323200 | 1269274472821555200 | 4376808526970880000 | 11029557487966617600 | 19841531988934656000 | 24276697962931814400 | 18334848811165286400 | 6790684744876032000 | 417888291992371200 | 86655318750000000000 | |
| 14 | 4969162598400 | 258745168281600 | 6219648007372800 | 91390746230784000 | 915938367779635200 | 6612628216165171200 | 35386496940559564800 | 142158740956014182400 | 428927235643146240000 | 960797007840647577600 | 1555576107932477030400 | 1730266472994412953600 | 1197876788996132044800 | 409530526152523776000 | 23401744351572787200 | 6491547562500000000000 |
Compute more
?
Technical details
- Node id
n-716a133f6399cf18· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-236e6d52004bfa9f
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept 0)
- Palindromic rows: no
- γ-positive (gamma_positive): no
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 5, 4; 2: 18, 80, 32; 3: 78, 648, 1440, 384; 4: 408, 4992, 20736, 30720, 6144; 5: 2520, 40800, 249600, 691200, 768000, 122880; 6: 18000, 362880, 2937600, 11980800, 24883200, 22118400, 2949120; 7: 146160, 3528000, 35562240, 191923200, 587059200, 975421440, 722534400, 82575360; 8: 1330560, 37416960, 451584000, 3034644480, 12283084800, 30057431040, 41617981440, 26424115200, 2642411520; 9: 13426560, 431101440, 6061547520, 48771072000, 245806202880, 795943895040, 1623101276160, 1926317998080, 1070176665600, 95126814720;
%F FormulaThe row polynomials satisfy (4*n-3+4*x)*P(n,x) = (4*n^2+n+(16*n^2+8*n)*x+16*n*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^2 + n + (16*n^2 + 8*n)*x + 16*n*x^2)*P[n - 1, x])/(4*n - 3 + 4*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((4*n^2 + n + (16*n^2 + 8*n)*x + 16*n*x^2)*v[i - 1])/(4*n - 3 + 4*x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
- ↑ Geometric basis map (elementary) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
-
from
basis_map_A013610 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
-
from
basis_map_A013611 of Triangle read by rows: row n consists of n zeros followed by n!.?
Related ?
Same fingerprint ?
- basis-map coefficients of A026729 → basis A013611 → D+1
- basis-map coefficients of A112227 → basis A013611 → D+1
- A013611 → D+1
- A130123 → basis A013611 → D+1
- A013611 → D → D+1
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.