A030528 → 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 - 5\,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_{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 | 4 | 2 | 6 | |||||||||||||
| 2 | 16 | 16 | 3 | 35 | ||||||||||||
| 3 | 64 | 96 | 40 | 5 | 205 | |||||||||||
| 4 | 256 | 512 | 336 | 88 | 8 | 1200 | ||||||||||
| 5 | 1024 | 2560 | 2304 | 944 | 180 | 13 | 7025 | |||||||||
| 6 | 4096 | 12288 | 14080 | 7936 | 2352 | 352 | 21 | 41125 | ||||||||
| 7 | 16384 | 57344 | 79872 | 57600 | 23424 | 5424 | 668 | 34 | 240750 | |||||||
| 8 | 65536 | 262144 | 430080 | 378880 | 197120 | 62464 | 11856 | 1240 | 55 | 1409375 | ||||||
| 9 | 262144 | 1179648 | 2228224 | 2322432 | 1477632 | 598272 | 155008 | 24912 | 2264 | 89 | 8250625 | |||||
| 10 | 1048576 | 5242880 | 11206656 | 13500416 | 10178560 | 5038080 | 1665280 | 364544 | 50784 | 4080 | 144 | 48300000 | ||||
| 11 | 4194304 | 23068672 | 55050240 | 75300864 | 65732608 | 38563840 | 15569920 | 4341760 | 822336 | 101072 | 7276 | 233 | 282753125 | |||
| 12 | 16777216 | 100663296 | 265289728 | 406323200 | 403439616 | 274202624 | 131174400 | 44636160 | 10754560 | 1794304 | 197280 | 12864 | 377 | 1655265625 | ||
| 13 | 67108864 | 436207616 | 1258291200 | 2133852160 | 2376335360 | 1838481408 | 1018888192 | 410562560 | 120591360 | 25562880 | 3810048 | 378912 | 22580 | 610 | 9690093750 | |
| 14 | 268435456 | 1879048192 | 5888802816 | 10955522048 | 13529776128 | 11750342656 | 7414284288 | 3460038656 | 1202647040 | 310497280 | 58734848 | 7909120 | 717968 | 39392 | 987 | 56726796875 |
Compute more
?
Technical details
- Node id
n-edf15db11e2841e8· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-fe14b25fdaf2823c
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: 4, 2; 2: 16, 16, 3; 3: 64, 96, 40, 5; 4: 256, 512, 336, 88, 8; 5: 1024, 2560, 2304, 944, 180, 13; 6: 4096, 12288, 14080, 7936, 2352, 352, 21; 7: 16384, 57344, 79872, 57600, 23424, 5424, 668, 34; 8: 65536, 262144, 430080, 378880, 197120, 62464, 11856, 1240, 55; 9: 262144, 1179648, 2228224, 2322432, 1477632, 598272, 155008, 24912, 2264, 89;
%F FormulaThe row polynomials satisfy (4*n+4)*P(n,x) = (16*n+16+16*n*x+(5*n-5)*x^2)*P(n-1,x) - (16*x+24*x^2+5*x^3)*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[((16*n + 16 + 16*n*x + (5*n - 5)*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, 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] = ((16*n + 16 + 16*n*x + (5*n - 5)*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 - 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 (−∞, 0]
- 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)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (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).?
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