A104684 → basis A013611 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(8 - 8\,n + 2\,n^{2}\right)\,P_{n}(x) = \left(46 + 88\,x - 52\,n - 96\,n x + 14\,n^{2} + 24\,n^{2} x\right)\,P_{n-1}(x) + \left(3 + 18\,x + 24\,x^{2} - 2\,n - 12\,n x - 16\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | ||||||||||||||
| 2 | 4 | 4 | |||||||||||||
| 3 | 32 | 32 | 64 | ||||||||||||
| 4 | 228 | 480 | 192 | 900 | |||||||||||
| 5 | 1536 | 4992 | 4608 | 1024 | 12160 | ||||||||||
| 6 | 10020 | 44160 | 65280 | 35840 | 5120 | 160420 | |||||||||
| 7 | 64032 | 356640 | 729600 | 660480 | 245760 | 24576 | 2081088 | ||||||||
| 8 | 403396 | 2716896 | 7116480 | 9067520 | 5698560 | 1548288 | 114688 | 26665828 | |||||||
| 9 | 2514944 | 19873280 | 63522816 | 104796160 | 94044160 | 44040192 | 9175040 | 524288 | 338490880 | ||||||
| 10 | 15554628 | 141083136 | 532675584 | 1080963072 | 1268305920 | 858783744 | 313786368 | 51904512 | 2359296 | 4265416260 | |||||
| 11 | 95600160 | 978850080 | 4264151040 | 10282782720 | 14946140160 | 13346242560 | 7129006080 | 2099773440 | 283115520 | 10485760 | 53436147520 | ||||
| 12 | 584585892 | 6669162720 | 32932152000 | 92056842240 | 159861166080 | 177964351488 | 126333419520 | 54932275200 | 13365411840 | 1499463680 | 46137344 | 666244968004 | |||
| 13 | 3559712256 | 44774395776 | 247172682240 | 786133877760 | 1589218836480 | 2124036440064 | 1890595897344 | 1100116131840 | 398626652160 | 81663098880 | 7751073792 | 201326592 | 8273850125184 | ||
| 14 | 21599884644 | 296957980800 | 1812449523456 | 6464264801280 | 14919592596480 | 23303464943616 | 25013865676800 | 18346013097984 | 8952360468480 | 2753015316480 | 482227519488 | 39258685440 | 872415232 | 102405942910180 | |
| 15 | 130672946208 | 1949430022176 | 13035449516544 | 51534119949312 | 133758497832960 | 239281364754432 | 301234643533824 | 267526737494016 | 165334763962368 | 68865868431360 | 18238276632576 | 2766428700672 | 195421011968 | 3758096384 | 1263855432884800 |
Compute more
?
Technical details
- Node id
n-4a95cea6638bf316· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-b91fbc6aa50ad79c
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -2)
- 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: 0; 2: 4; 3: 32, 32; 4: 228, 480, 192; 5: 1536, 4992, 4608, 1024; 6: 10020, 44160, 65280, 35840, 5120; 7: 64032, 356640, 729600, 660480, 245760, 24576; 8: 403396, 2716896, 7116480, 9067520, 5698560, 1548288, 114688; 9: 2514944, 19873280, 63522816, 104796160, 94044160, 44040192, 9175040, 524288; 10: 15554628, 141083136, 532675584, 1080963072, 1268305920, 858783744, 313786368, 51904512, 2359296;
%F FormulaThe row polynomials satisfy (2*n^2-8*n+8)*P(n,x) = (14*n^2-52*n+46+(24*n^2-96*n+88)*x)*P(n-1,x) - (2*n-3+(12*n-18)*x+(16*n-24)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 4.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[((14*n^2 - 52*n + 46 + (24*n^2 - 96*n + 88)*x)*P[n - 1, x] - (2*n - 3 + (12*n - 18)*x + (16*n - 24)*x^2)*D[P[n - 1, x], x])/(2*n^2 - 8*n + 8)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 4; for(n = 3, N, my(i = n); v[i] = ((14*n^2 - 52*n + 46 + (24*n^2 - 96*n + 88)*x)*v[i - 1] - (2*n - 3 + (12*n - 18)*x + (16*n - 24)*x^2)*deriv(v[i - 1], x))/(2*n^2 - 8*n + 8)); 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 Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] 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 ?
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