A008288 → basis A013611 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + 2\,n\right)\,P_{n}(x) = \left(-8 + 8\,x + 20\,x^{2} + 6\,x^{3} + 8\,n - 14\,n x - 18\,n x^{2} - 5\,n x^{3} + 6\,n^{2} x + 4\,n^{2} x^{2} + n^{2} x^{3}\right)\,P_{n-1}(x) + \left(8\,x + 46\,x^{2} + 34\,x^{3} + 6\,x^{4} - 8\,n x - 20\,n x^{2} - 12\,n x^{3} - 2\,n x^{4}\right)\,P_{n-1}'(x) + \left(8\,x^{2} + 18\,x^{3} + 8\,x^{4} + x^{5}\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 | 2 | 6 | |||||||||||||
| 3 | 16 | 20 | 5 | 41 | ||||||||||||
| 4 | 64 | 128 | 72 | 12 | 276 | |||||||||||
| 5 | 256 | 704 | 640 | 232 | 29 | 1861 | ||||||||||
| 6 | 1024 | 3584 | 4544 | 2624 | 700 | 70 | 12546 | |||||||||
| 7 | 4096 | 17408 | 28416 | 22848 | 9616 | 2028 | 169 | 84581 | ||||||||
| 8 | 16384 | 81920 | 163840 | 169984 | 99200 | 32768 | 5712 | 408 | 570216 | |||||||
| 9 | 65536 | 376832 | 892928 | 1138688 | 856576 | 390784 | 106112 | 15760 | 985 | 3844201 | ||||||
| 10 | 262144 | 1703936 | 4669440 | 7077888 | 6547456 | 3843072 | 1436288 | 330880 | 42804 | 2378 | 25916286 | |||||
| 11 | 1048576 | 7602176 | 23658496 | 41598976 | 45793280 | 33032192 | 15851008 | 5011328 | 1002128 | 114820 | 5741 | 174718721 | ||||
| 12 | 4194304 | 33554432 | 116916224 | 234094592 | 299352064 | 256983040 | 151388160 | 61335552 | 16790976 | 2965632 | 304920 | 13860 | 1177893756 | |||
| 13 | 16777216 | 146800640 | 566231040 | 1272446976 | 1855651840 | 1851408384 | 1297440768 | 644554752 | 225731328 | 54464320 | 8612352 | 803064 | 33461 | 7940956141 | ||
| 14 | 67108864 | 637534208 | 2696937472 | 6723469312 | 11020795904 | 12548440064 | 10219864064 | 6035636224 | 2588765184 | 797819392 | 172031552 | 24622272 | 2100332 | 80782 | 53535205626 | |
| 15 | 268435456 | 2751463424 | 12666798080 | 34699476992 | 63186141184 | 80930406400 | 75237621760 | 51623444480 | 26301992960 | 9916288000 | 2727353600 | 531465920 | 69470480 | 5460700 | 195025 | 360916014461 |
Compute more
?
Technical details
- Node id
n-bdd516a53158e668· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-5f821ed5c717f4fd
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, 2; 3: 16, 20, 5; 4: 64, 128, 72, 12; 5: 256, 704, 640, 232, 29; 6: 1024, 3584, 4544, 2624, 700, 70; 7: 4096, 17408, 28416, 22848, 9616, 2028, 169; 8: 16384, 81920, 163840, 169984, 99200, 32768, 5712, 408; 9: 65536, 376832, 892928, 1138688, 856576, 390784, 106112, 15760, 985; 10: 262144, 1703936, 4669440, 7077888, 6547456, 3843072, 1436288, 330880, 42804, 2378;
%F FormulaThe row polynomials satisfy (2*n-2)*P(n,x) = (8*n-8+(6*n^2-14*n+8)*x+(4*n^2-18*n+20)*x^2+(n^2-5*n+6)*x^3)*P(n-1,x) - ((8*n-8)*x+(20*n-46)*x^2+(12*n-34)*x^3+(2*n-6)*x^4)*d/dx P(n-1,x) + (8*x^2+18*x^3+8*x^4+x^5)*d^2/dx^2 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[((8*n - 8 + (6*n^2 - 14*n + 8)*x + (4*n^2 - 18*n + 20)*x^2 + (n^2 - 5*n + 6)*x^3)*P[n - 1, x] - ((8*n - 8)*x + (20*n - 46)*x^2 + (12*n - 34)*x^3 + (2*n - 6)*x^4)*D[P[n - 1, x], x] + (8*x^2 + 18*x^3 + 8*x^4 + x^5)*D[P[n - 1, x], {x, 2}])/(2*n - 2)]];
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] = ((8*n - 8 + (6*n^2 - 14*n + 8)*x + (4*n^2 - 18*n + 20)*x^2 + (n^2 - 5*n + 6)*x^3)*v[i - 1] - ((8*n - 8)*x + (20*n - 46)*x^2 + (12*n - 34)*x^3 + (2*n - 6)*x^4)*deriv(v[i - 1], x) + (8*x^2 + 18*x^3 + 8*x^4 + x^5)*deriv(deriv(v[i - 1], x), x))/(2*n - 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
- 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 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_A013611 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