A104684 → basis A013611 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-4 + x + 2\,x^{2} + 4\,n + n x - n x^{2}\right)\,P_{n-1}(x) + \left(8\,x + 6\,x^{2} + x^{3}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 4 | 3 | 7 | |||||||||||||
| 3 | 16 | 32 | 13 | 61 | ||||||||||||
| 4 | 64 | 240 | 228 | 63 | 595 | |||||||||||
| 5 | 256 | 1536 | 2496 | 1536 | 321 | 6145 | ||||||||||
| 6 | 1024 | 8960 | 21760 | 22080 | 10020 | 1683 | 65527 | |||||||||
| 7 | 4096 | 49152 | 165120 | 243200 | 178320 | 64032 | 8989 | 712909 | ||||||||
| 8 | 16384 | 258048 | 1139712 | 2266880 | 2372160 | 1358448 | 403396 | 48639 | 7863667 | |||||||
| 9 | 65536 | 1310720 | 7340032 | 18808832 | 26199040 | 21174272 | 9936640 | 2514944 | 265729 | 87615745 | ||||||
| 10 | 262144 | 6488064 | 44826624 | 143130624 | 253661184 | 270240768 | 177558528 | 70541568 | 15554628 | 1462563 | 983726695 | |||||
| 11 | 1048576 | 31457280 | 262471680 | 1018429440 | 2224373760 | 2989228032 | 2570695680 | 1421383680 | 489425040 | 95600160 | 8097453 | 11112210781 | ||||
| 12 | 4194304 | 149946368 | 1485045760 | 6866534400 | 18047631360 | 29660725248 | 31972233216 | 23014210560 | 10977384000 | 3334581360 | 584585892 | 45046719 | 126142119187 | |||
| 13 | 16777216 | 704643072 | 8166309888 | 44291850240 | 137514516480 | 270085128192 | 354006073344 | 317843767296 | 196533469440 | 82390894080 | 22387197888 | 3559712256 | 251595969 | 1437751935361 | ||
| 14 | 67108864 | 3271557120 | 43838865408 | 275301531648 | 994706718720 | 2293251637248 | 3573409382400 | 3883910823936 | 2983918519296 | 1616066200320 | 604149841152 | 148478990400 | 21599884644 | 1409933619 | 16443380994775 | |
| 15 | 268435456 | 15032385536 | 230535725056 | 1658025148416 | 6886586843136 | 18370529329152 | 33440842186752 | 43033520504832 | 39880227459072 | 26751699566592 | 12883529987328 | 4345149838848 | 974715011088 | 130672946208 | 7923848253 | 188609259215725 |
Compute more
?
Technical details
- Node id
n-3bf3b2c1960395d5· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-e88a2f797c4f541a
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: 4, 3; 3: 16, 32, 13; 4: 64, 240, 228, 63; 5: 256, 1536, 2496, 1536, 321; 6: 1024, 8960, 21760, 22080, 10020, 1683; 7: 4096, 49152, 165120, 243200, 178320, 64032, 8989; 8: 16384, 258048, 1139712, 2266880, 2372160, 1358448, 403396, 48639; 9: 65536, 1310720, 7340032, 18808832, 26199040, 21174272, 9936640, 2514944, 265729; 10: 262144, 6488064, 44826624, 143130624, 253661184, 270240768, 177558528, 70541568, 15554628, 1462563;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (4*n-4+(n+1)*x-(n-2)*x^2)*P(n-1,x) + (8*x+6*x^2+x^3)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 4 + (n + 1)*x - (n - 2)*x^2)*P[n - 1, x] + (8*x + 6*x^2 + x^3)*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((4*n - 4 + (n + 1)*x - (n - 2)*x^2)*v[i - 1] + (8*x + 6*x^2 + x^3)*deriv(v[i - 1], x))/(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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
-
Geometric basis map (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.?
-
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) (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,…?
- ↑ 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.?
- ↑ 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,…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
Related ?
Same fingerprint ?
- A133214 → basis A013609
- A104684 → basis A013611
- A133214 → basis A013609 → reverse
- A008459 → x ↦ x+1 → basis A013611
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