A008288 → basis A013609 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(18 + 6\,x - 11\,n - 2\,n x + 2\,n^{2}\right)\,P_{n-1}(x) + \left(55 + 51\,x + 10\,x^{2} - 14\,n - 12\,n x - 2\,n x^{2}\right)\,P_{n-1}'(x) + \left(21 + 32\,x + 15\,x^{2} + 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 | 2 | 6 | |||||||||||||
| 3 | 19 | 18 | 4 | 41 | ||||||||||||
| 4 | 88 | 124 | 56 | 8 | 276 | |||||||||||
| 5 | 409 | 764 | 520 | 152 | 16 | 1861 | ||||||||||
| 6 | 1900 | 4422 | 4024 | 1784 | 384 | 32 | 12546 | |||||||||
| 7 | 8827 | 24598 | 28028 | 16680 | 5456 | 928 | 64 | 84581 | ||||||||
| 8 | 41008 | 133112 | 182224 | 136176 | 59904 | 15488 | 2176 | 128 | 570216 | |||||||
| 9 | 190513 | 705912 | 1128400 | 1015248 | 561696 | 195456 | 41728 | 4992 | 256 | 3844201 | ||||||
| 10 | 885076 | 3686026 | 6738320 | 7090768 | 4729344 | 2071488 | 595328 | 108160 | 11264 | 512 | 25916286 | |||||
| 11 | 4111843 | 19013018 | 39122356 | 47142256 | 36814496 | 19454400 | 7040384 | 1721728 | 272128 | 25088 | 1024 | 174718721 | ||||
| 12 | 19102600 | 97103988 | 222102472 | 301562680 | 269912064 | 167119744 | 72999296 | 22482816 | 4782080 | 668672 | 55296 | 2048 | 1177893756 | |||
| 13 | 88745929 | 491883892 | 1238010968 | 1870127144 | 1887501616 | 1340295296 | 686266624 | 255175808 | 68353792 | 12858368 | 1611776 | 120832 | 4096 | 7940956141 | ||
| 14 | 412291516 | 2474544590 | 6796327048 | 11305423496 | 12703122304 | 10177367776 | 5978894464 | 2606683520 | 843078656 | 199711232 | 33667072 | 3823616 | 262144 | 8192 | 53535205626 | |
| 15 | 1915403851 | 12375904926 | 36832198060 | 66900751448 | 82826095344 | 73911604832 | 49009703872 | 24522583680 | 9301094656 | 2660284928 | 564642816 | 86214656 | 8949760 | 565248 | 16384 | 360916014461 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(P_{n}(x) = \left(3 + 2\,x\right)\,P_{n-2}(x) + \left(4 + 2\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 4 + 2\,x\)
Technical details
- Node id
n-2da37fcf9fa60a2f· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-d11a8911209dff68)- Fingerprint
f6-b4e11046d64dfe4b
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: 19, 18, 4; 4: 88, 124, 56, 8; 5: 409, 764, 520, 152, 16; 6: 1900, 4422, 4024, 1784, 384, 32; 7: 8827, 24598, 28028, 16680, 5456, 928, 64; 8: 41008, 133112, 182224, 136176, 59904, 15488, 2176, 128; 9: 190513, 705912, 1128400, 1015248, 561696, 195456, 41728, 4992, 256; 10: 885076, 3686026, 6738320, 7090768, 4729344, 2071488, 595328, 108160, 11264, 512;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (2*n^2-11*n+18-(2*n-6)*x)*P(n-1,x) - (14*n-55+(12*n-51)*x+(2*n-10)*x^2)*d/dx P(n-1,x) + (21+32*x+15*x^2+2*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[((2*n^2 - 11*n + 18 - (2*n - 6)*x)*P[n - 1, x] - (14*n - 55 + (12*n - 51)*x + (2*n - 10)*x^2)*D[P[n - 1, x], x] + (21 + 32*x + 15*x^2 + 2*x^3)*D[P[n - 1, x], {x, 2}])/(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] = ((2*n^2 - 11*n + 18 - (2*n - 6)*x)*v[i - 1] - (14*n - 55 + (12*n - 51)*x + (2*n - 10)*x^2)*deriv(v[i - 1], x) + (21 + 32*x + 15*x^2 + 2*x^3)*deriv(deriv(v[i - 1], x), 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 (−∞, -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_A013609 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_A013609 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