A008288 → basis A013611 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-2 + 2\,n\right)\,P_{n}(x) = \left(48 + 24\,x - 26\,n - 8\,n x + 4\,n^{2}\right)\,P_{n-1}(x) + \left(116 + 142\,x + 40\,x^{2} - 28\,n - 32\,n x - 8\,n x^{2}\right)\,P_{n-1}'(x) + \left(35 + 68\,x + 42\,x^{2} + 8\,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 | 6 | 4 | 10 | |||||||||||||
| 3 | 41 | 52 | 16 | 109 | ||||||||||||
| 4 | 276 | 520 | 320 | 64 | 1180 | |||||||||||
| 5 | 1861 | 4648 | 4288 | 1728 | 256 | 12781 | ||||||||||
| 6 | 12546 | 39036 | 48000 | 29120 | 8704 | 1024 | 138430 | |||||||||
| 7 | 84581 | 315084 | 484176 | 392512 | 176896 | 41984 | 4096 | 1499329 | ||||||||
| 8 | 570216 | 2474192 | 4561536 | 4629376 | 2791424 | 999424 | 196608 | 16384 | 16239160 | |||||||
| 9 | 3844201 | 19039760 | 40947200 | 49921664 | 37720576 | 18079744 | 5365760 | 901120 | 65536 | 175885561 | ||||||
| 10 | 25916286 | 144267188 | 354546688 | 504711808 | 458484736 | 275523584 | 109494272 | 27738112 | 4063232 | 262144 | 1905008050 | |||||
| 11 | 174718721 | 1079843876 | 2985243920 | 4859854720 | 5158045184 | 3728361472 | 1858207744 | 630374400 | 139264000 | 18087936 | 1048576 | 20633050549 | ||||
| 12 | 1177893756 | 8002939224 | 24580641216 | 45041849792 | 54698960896 | 46213906432 | 27712258048 | 11791745024 | 3488350208 | 683147264 | 79691776 | 4194304 | 223475577940 | |||
| 13 | 7940956141 | 58827304632 | 198741199296 | 404813912896 | 553590809344 | 535353270272 | 375333658624 | 192184205312 | 71314898944 | 18699780096 | 3288334336 | 348127232 | 16777216 | 2420453234341 | ||
| 14 | 53535205626 | 429453923500 | 1582671377280 | 3547380088384 | 5394462711296 | 5876348234752 | 4716831948800 | 2824247623680 | 1261234946048 | 414827413504 | 97660174336 | 15581839360 | 1509949440 | 67108864 | 26215812544870 | |
| 15 | 360916014461 | 3116764711228 | 12442859172688 | 30434000401088 | 50943506319616 | 61727069842432 | 55824466006016 | 38275069198336 | 19989711486976 | 7912662761472 | 2336511492096 | 499025707008 | 72863449088 | 6509559808 | 268435456 | 283942204557769 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(P_{n}(x) = \left(5 + 4\,x\right)\,P_{n-2}(x) + \left(6 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 6 + 4\,x\)
Technical details
- Node id
n-5b8a0617c6e3d711· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-24b7573b5b48c965)- Fingerprint
f6-c7d411e7f35c62e3
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: 6, 4; 3: 41, 52, 16; 4: 276, 520, 320, 64; 5: 1861, 4648, 4288, 1728, 256; 6: 12546, 39036, 48000, 29120, 8704, 1024; 7: 84581, 315084, 484176, 392512, 176896, 41984, 4096; 8: 570216, 2474192, 4561536, 4629376, 2791424, 999424, 196608, 16384; 9: 3844201, 19039760, 40947200, 49921664, 37720576, 18079744, 5365760, 901120, 65536; 10: 25916286, 144267188, 354546688, 504711808, 458484736, 275523584, 109494272, 27738112, 4063232, 262144;
%F FormulaThe row polynomials satisfy (2*n-2)*P(n,x) = (4*n^2-26*n+48-(8*n-24)*x)*P(n-1,x) - (28*n-116+(32*n-142)*x+(8*n-40)*x^2)*d/dx P(n-1,x) + (35+68*x+42*x^2+8*x^3)*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[((4*n^2 - 26*n + 48 - (8*n - 24)*x)*P[n - 1, x] - (28*n - 116 + (32*n - 142)*x + (8*n - 40)*x^2)*D[P[n - 1, x], x] + (35 + 68*x + 42*x^2 + 8*x^3)*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] = ((4*n^2 - 26*n + 48 - (8*n - 24)*x)*v[i - 1] - (28*n - 116 + (32*n - 142)*x + (8*n - 40)*x^2)*deriv(v[i - 1], x) + (35 + 68*x + 42*x^2 + 8*x^3)*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 (−∞, -1]
- 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)
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
- 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_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