A008288 → basis A013610 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-24 + 36\,x + 54\,x^{2} + 12\,n - 54\,n x - 27\,n x^{2} + 18\,n^{2} x\right)\,P_{n}(x) = \left(-192 - 720\,x - 648\,x^{2} - 162\,x^{3} + 156\,n + 486\,n x + 243\,n x^{2} - 24\,n^{2} - 54\,n^{2} x\right)\,P_{n-1}(x) + \left(-32 - 216\,x - 468\,x^{2} - 351\,x^{3} - 81\,x^{4} + 16\,n + 96\,n x + 162\,n x^{2} + 54\,n x^{3}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | ||||||||||||||
| 2 | 3 | 3 | |||||||||||||
| 3 | 15 | 18 | 33 | ||||||||||||
| 4 | 54 | 144 | 81 | 279 | |||||||||||
| 5 | 174 | 720 | 891 | 324 | 2109 | ||||||||||
| 6 | 525 | 2952 | 5751 | 4536 | 1215 | 14979 | |||||||||
| 7 | 1521 | 10818 | 28917 | 35964 | 20655 | 4374 | 102249 | ||||||||
| 8 | 4284 | 36864 | 125550 | 215136 | 194400 | 87480 | 15309 | 679023 | |||||||
| 9 | 11820 | 119376 | 494586 | 1084104 | 1351080 | 953532 | 352107 | 52488 | 4419093 | ||||||
| 10 | 32103 | 372240 | 1817802 | 4863888 | 7768710 | 7558272 | 4363065 | 1364688 | 177147 | 28317915 | |||||
| 11 | 86115 | 1127394 | 6342462 | 20061432 | 39193470 | 48901320 | 38869551 | 18948168 | 5137263 | 590490 | 179257665 | ||||
| 12 | 228690 | 3336336 | 21251079 | 77627808 | 179625600 | 274424760 | 279710739 | 187487136 | 79007562 | 18895680 | 1948617 | 1123544007 | |||
| 13 | 602298 | 9688896 | 68931405 | 285691212 | 764779320 | 1385499492 | 1729932309 | 1486197720 | 859871538 | 318864600 | 68201595 | 6377292 | 6984637677 | ||
| 14 | 1575249 | 27700056 | 217727433 | 1009740168 | 3071630565 | 6445281456 | 9549310239 | 10050087312 | 7447437027 | 3786221880 | 1252960731 | 242337096 | 20726199 | 43122735411 | |
| 15 | 4095525 | 78154290 | 672636555 | 3451806900 | 11765908125 | 28087137990 | 48236286105 | 60258061080 | 54689707575 | 35582336910 | 16120908441 | 4814855460 | 849774159 | 66961566 | 264678630681 |
Compute more
?
Technical details
- Node id
n-dafc11e250801ee0· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-efa4ceed12824448
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: 3; 3: 15, 18; 4: 54, 144, 81; 5: 174, 720, 891, 324; 6: 525, 2952, 5751, 4536, 1215; 7: 1521, 10818, 28917, 35964, 20655, 4374; 8: 4284, 36864, 125550, 215136, 194400, 87480, 15309; 9: 11820, 119376, 494586, 1084104, 1351080, 953532, 352107, 52488; 10: 32103, 372240, 1817802, 4863888, 7768710, 7558272, 4363065, 1364688, 177147;
%F FormulaThe row polynomials satisfy (12*n-24+(18*n^2-54*n+36)*x-(27*n-54)*x^2)*P(n,x) = -(24*n^2-156*n+192+(54*n^2-486*n+720)*x-(243*n-648)*x^2+162*x^3)*P(n-1,x) + (16*n-32+(96*n-216)*x+(162*n-468)*x^2+(54*n-351)*x^3-81*x^4)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 3.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[(-(24*n^2 - 156*n + 192 + (54*n^2 - 486*n + 720)*x - (243*n - 648)*x^2 + 162*x^3)*P[n - 1, x] + (16*n - 32 + (96*n - 216)*x + (162*n - 468)*x^2 + (54*n - 351)*x^3 - 81*x^4)*D[P[n - 1, x], x])/(12*n - 24 + (18*n^2 - 54*n + 36)*x - (27*n - 54)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 3; for(n = 3, N, my(i = n); v[i] = (-(24*n^2 - 156*n + 192 + (54*n^2 - 486*n + 720)*x - (243*n - 648)*x^2 + 162*x^3)*v[i - 1] + (16*n - 32 + (96*n - 216)*x + (162*n - 468)*x^2 + (54*n - 351)*x^3 - 81*x^4)*deriv(v[i - 1], x))/(12*n - 24 + (18*n^2 - 54*n + 36)*x - (27*n - 54)*x^2)); 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_A013610 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
-
from
basis_map_A013610 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
Related ?
Same fingerprint ?
References
- [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.