A063007 → basis A013610 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - n\right)\,P_{n}(x) = \left(-2 + n\right)\,P_{n-2}(x) + \left(27 + 36\,x - 18\,n - 24\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 9 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 9 | 12 | 21 | |||||||||||||
| 3 | 121 | 324 | 216 | 661 | ||||||||||||
| 4 | 1809 | 7272 | 9720 | 4320 | 23121 | |||||||||||
| 5 | 28401 | 152280 | 305640 | 272160 | 90720 | 849201 | ||||||||||
| 6 | 458649 | 3074580 | 8232840 | 11007360 | 7348320 | 1959552 | 32081301 | |||||||||
| 7 | 7544041 | 60693948 | 203227920 | 362517120 | 363333600 | 193995648 | 43110144 | 1234422421 | ||||||||
| 8 | 125700129 | 1179944976 | 4742360784 | 10578859200 | 14145516000 | 11337967872 | 5043886848 | 960740352 | 48114976161 | |||||||
| 9 | 2114588641 | 22686717168 | 106398275760 | 284904164160 | 476411997600 | 509432571648 | 340182146304 | 129699947520 | 21616657920 | 1893447066721 | ||||||
| 10 | 35836273449 | 432556027740 | 2318787511920 | 7245661610880 | 14544257888160 | 19448947469952 | 17325751322880 | 9914840432640 | 3307348661760 | 489977579520 | 75063964778901 | |||||
| 11 | 610897146201 | 8193357063540 | 49417785438120 | 176512755070080 | 413479123817760 | 663727592271744 | 739400186004480 | 564454171607040 | 282594568988160 | 83786166097920 | 11171488813056 | 2993348092318101 | ||||
| 12 | 10463745263409 | 154378636870392 | 1034681777517960 | 4158339638412960 | 11134847827303200 | 20858796787885056 | 27893884626736128 | 26628321536593920 | 17783613754283520 | 7913137909248000 | 2111411385667584 | 255928652808192 | 119937806278590321 | |||
| 13 | 179939616743121 | 2896187049764424 | 21353669673552216 | 95367236286722400 | 287338914174312000 | 615307327659408384 | 960244052428717056 | 1100380476597202944 | 918959687581478400 | 545447941297459200 | 218413777784057856 | 52977231131295744 | 5886359014588416 | 4824752800295302161 | ||
| 14 | 3104680678772409 | 54136263659806692 | 435462739242181560 | 2139525306993634560 | 7163677569331483200 | 17261193647246605056 | 30793260267597155328 | 41179944854195896320 | 41282051486149393920 | 30639902723958528000 | 16365549650309443584 | 5956995322763476992 | 1324430778282393600 | 135839054182809600 | 194735074344591580821 | |
| 15 | 53721299280288201 | 1008812726972024940 | 8791428382562236320 | 47125343074442330880 | 173588888780658711360 | 464821613820339519744 | 933064701003745390080 | 1426388427148236963840 | 1668706726282515279360 | 1486699301442675640320 | 992951262034040365056 | 482092803294791270400 | 160844760073628467200 | 33008890166422732800 | 3143703825373593600 | 7882290383355684814101 |
Compute more
?
Technical details
- Node id
n-421f5562485e7f0c· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-639e3b5d50844ba9
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 -1)
- 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 ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 9, 12; 3: 121, 324, 216; 4: 1809, 7272, 9720, 4320; 5: 28401, 152280, 305640, 272160, 90720; 6: 458649, 3074580, 8232840, 11007360, 7348320, 1959552; 7: 7544041, 60693948, 203227920, 362517120, 363333600, 193995648, 43110144; 8: 125700129, 1179944976, 4742360784, 10578859200, 14145516000, 11337967872, 5043886848, 960740352; 9: 2114588641, 22686717168, 106398275760, 284904164160, 476411997600, 509432571648, 340182146304, 129699947520, 21616657920; 10: 35836273449, 432556027740, 2318787511920, 7245661610880, 14544257888160, 19448947469952, 17325751322880, 9914840432640, 3307348661760, 489977579520;
%F FormulaThe row polynomials satisfy -(n-1)*P(n,x) = (n-2)*P(n-2,x) - (18*n-27+(24*n-36)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 9 + 12*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 9 + 12*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 2, x] - (18*n - 27 + (24*n - 36)*x)*P[n - 1, x])/(-n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 9 + 12*x; for(n = 3, N, my(i = n); v[i] = ((n - 2)*v[i - 2] - (18*n - 27 + (24*n - 36)*x)*v[i - 1])/(-n + 1)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
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
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
-
from
basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023