A026729 → basis A013611 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4 + 4\,n\right)\,P_{n}(x) = \left(-16 - 28\,x - 10\,x^{2} + 16\,n + 16\,n x + 5\,n x^{2}\right)\,P_{n-1}(x) + \left(-16\,x - 24\,x^{2} - 5\,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 | 1 | 5 | |||||||||||||
| 3 | 16 | 12 | 2 | 30 | ||||||||||||
| 4 | 64 | 80 | 28 | 3 | 175 | |||||||||||
| 5 | 256 | 448 | 256 | 60 | 5 | 1025 | ||||||||||
| 6 | 1024 | 2304 | 1856 | 688 | 120 | 8 | 6000 | |||||||||
| 7 | 4096 | 11264 | 11776 | 6080 | 1664 | 232 | 13 | 35125 | ||||||||
| 8 | 16384 | 53248 | 68608 | 45824 | 17344 | 3760 | 436 | 21 | 205625 | |||||||
| 9 | 65536 | 245760 | 376832 | 310272 | 151296 | 45120 | 8096 | 804 | 34 | 1203750 | ||||||
| 10 | 262144 | 1114112 | 1982464 | 1945600 | 1167360 | 446976 | 109888 | 16816 | 1460 | 55 | 7046875 | |||||
| 11 | 1048576 | 4980736 | 10092544 | 11517952 | 8232960 | 3870720 | 1218304 | 254656 | 33968 | 2620 | 89 | 41253125 | ||||
| 12 | 4194304 | 22020096 | 50069504 | 65208320 | 54214656 | 30330880 | 11699200 | 3123456 | 567680 | 67104 | 4656 | 144 | 241500000 | |||
| 13 | 16777216 | 96468992 | 243269632 | 356253696 | 338231296 | 219987968 | 100843520 | 32936960 | 7631104 | 1226624 | 130176 | 8208 | 233 | 1413765625 | ||
| 14 | 67108864 | 419430400 | 1161822208 | 1890582528 | 2020081664 | 1500250112 | 798900224 | 309719040 | 87654400 | 17931776 | 2583424 | 248736 | 14372 | 377 | 8276328125 | |
| 15 | 268435456 | 1811939328 | 5469372416 | 9793699840 | 11639193600 | 9730260992 | 5914034176 | 2661138432 | 892928000 | 222842880 | 40803072 | 5325696 | 469232 | 25020 | 610 | 48450468750 |
Compute more
?
Technical details
- Node id
n-304dfb3caed26af2· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-b3d4d0fb6f0d839f
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, 1; 3: 16, 12, 2; 4: 64, 80, 28, 3; 5: 256, 448, 256, 60, 5; 6: 1024, 2304, 1856, 688, 120, 8; 7: 4096, 11264, 11776, 6080, 1664, 232, 13; 8: 16384, 53248, 68608, 45824, 17344, 3760, 436, 21; 9: 65536, 245760, 376832, 310272, 151296, 45120, 8096, 804, 34; 10: 262144, 1114112, 1982464, 1945600, 1167360, 446976, 109888, 16816, 1460, 55;
%F FormulaThe row polynomials satisfy (4*n-4)*P(n,x) = (16*n-16+(16*n-28)*x+(5*n-10)*x^2)*P(n-1,x) - (16*x+24*x^2+5*x^3)*d/dx 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[((16*n - 16 + (16*n - 28)*x + (5*n - 10)*x^2)*P[n - 1, x] - (16*x + 24*x^2 + 5*x^3)*D[P[n - 1, x], x])/(4*n - 4)]];
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] = ((16*n - 16 + (16*n - 28)*x + (5*n - 10)*x^2)*v[i - 1] - (16*x + 24*x^2 + 5*x^3)*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, 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 binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
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…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
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…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
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
- [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