A030528 → basis A013611 → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(4 + 4\,n\right)\,P_{n}(x) = \left(56 + 32\,x - 8\,n\right)\,P_{n-1}(x) + \left(45 + 56\,x + 16\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 6 | 4 | 10 | |||||||||||||
| 2 | 35 | 48 | 16 | 99 | ||||||||||||
| 3 | 205 | 424 | 288 | 64 | 981 | |||||||||||
| 4 | 1200 | 3320 | 3408 | 1536 | 256 | 9720 | ||||||||||
| 5 | 7025 | 24340 | 33456 | 22784 | 7680 | 1024 | 96309 | |||||||||
| 6 | 41125 | 171200 | 294960 | 269056 | 136960 | 36864 | 4096 | 954261 | ||||||||
| 7 | 240750 | 1170300 | 2424240 | 2772864 | 1890560 | 768000 | 172032 | 16384 | 9455130 | |||||||
| 8 | 1409375 | 7835000 | 18962000 | 26086400 | 22305280 | 12134400 | 4100096 | 786432 | 65536 | 93684519 | ||||||
| 9 | 8250625 | 51627000 | 142952400 | 229841280 | 236416256 | 161295360 | 72970240 | 21102592 | 3538944 | 262144 | 928256841 | |||||
| 10 | 48300000 | 335950000 | 1047420000 | 1927296000 | 2317318400 | 1902034944 | 1079070720 | 417726464 | 105578496 | 15728640 | 1048576 | 9197472240 | ||||
| 11 | 282753125 | 2164087500 | 7502170000 | 15547176000 | 21397222400 | 20531590144 | 14013526016 | 6802309120 | 2300903424 | 516423680 | 69206016 | 4194304 | 91131561729 | |||
| 12 | 1655265625 | 13824400000 | 52748100000 | 121570720000 | 188470592000 | 207026288640 | 165197484032 | 96470564864 | 40912551936 | 12286689280 | 2479882240 | 301989888 | 16777216 | 902961305721 | ||
| 13 | 9690093750 | 87694512500 | 365205300000 | 926590560000 | 1597810656000 | 1977260651520 | 1806286565376 | 1233208410112 | 629158772736 | 236869386240 | 63957893120 | 11727273984 | 1308622848 | 67108864 | 8946835807050 | |
| 14 | 56726796875 | 552976000000 | 2495842650000 | 6912620000000 | 13124051360000 | 18066559692800 | 18594568007680 | 14534331072512 | 8669072523264 | 3926065676288 | 1328813178880 | 325897420800 | 54744055808 | 5637144576 | 268435456 | 88648174014939 |
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(5 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 4\,x\)
Technical details
- Node id
n-c543221da2eb63df· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-7bfc29c470808344)- Fingerprint
f6-4285d334207d89bf
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 0)
- 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 6, 4; 2: 35, 48, 16; 3: 205, 424, 288, 64; 4: 1200, 3320, 3408, 1536, 256; 5: 7025, 24340, 33456, 22784, 7680, 1024; 6: 41125, 171200, 294960, 269056, 136960, 36864, 4096; 7: 240750, 1170300, 2424240, 2772864, 1890560, 768000, 172032, 16384; 8: 1409375, 7835000, 18962000, 26086400, 22305280, 12134400, 4100096, 786432, 65536; 9: 8250625, 51627000, 142952400, 229841280, 236416256, 161295360, 72970240, 21102592, 3538944, 262144;
%F FormulaThe row polynomials satisfy (4*n+4)*P(n,x) = -(8*n-56-32*x)*P(n-1,x) + (45+56*x+16*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(8*n - 56 - 32*x)*P[n - 1, x] + (45 + 56*x + 16*x^2)*D[P[n - 1, x], x])/(4*n + 4)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(8*n - 56 - 32*x)*v[i - 1] + (45 + 56*x + 16*x^2)*deriv(v[i - 1], x))/(4*n + 4)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Real-rooted? Every row P_n, n ≥ 0, 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 ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
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
delannoy?
- ↑ 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
delannoy?
- ↑ 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
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741