A026729 → basis A013611 → basis A013611
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(5 + 16\,x\right)\,P_{n-2}(x) + \left(5 + 16\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 5 + 16\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 5 | 16 | 21 | |||||||||||||
| 3 | 30 | 176 | 256 | 462 | ||||||||||||
| 4 | 175 | 1520 | 4352 | 4096 | 10143 | |||||||||||
| 5 | 1025 | 11760 | 50176 | 94208 | 65536 | 222705 | ||||||||||
| 6 | 6000 | 85600 | 485120 | 1363968 | 1900544 | 1048576 | 4889808 | |||||||||
| 7 | 35125 | 599200 | 4234240 | 15855616 | 33161216 | 36700160 | 16777216 | 107362773 | ||||||||
| 8 | 205625 | 4082000 | 34553600 | 161607680 | 450822144 | 749731840 | 687865856 | 268435456 | 2357304201 | |||||||
| 9 | 1203750 | 27258000 | 268838400 | 1507921920 | 5259329536 | 11675893760 | 16106127360 | 12616466432 | 4294967296 | 51758006454 | ||||||
| 10 | 7046875 | 179250000 | 2018400000 | 13201920000 | 55263232000 | 153490554880 | 282779975680 | 333128400896 | 227633266688 | 68719476736 | 1136421523755 | |||||
| 11 | 41253125 | 1164550000 | 14740320000 | 110145024000 | 537970278400 | 1794193227776 | 4137093693440 | 6510901985280 | 6691559047168 | 4054449127424 | 1099511627776 | 24951770134389 | ||||
| 12 | 241500000 | 7491800000 | 105294400000 | 884874240000 | 4939718656000 | 19230155079680 | 53262308868096 | 104938130636800 | 144100447748096 | 131322920042496 | 71468255805440 | 17592186044416 | 547852024821024 | |||
| 13 | 1413765625 | 47805800000 | 738675200000 | 6895651840000 | 43308752896000 | 192764764487680 | 623386585726976 | 1475635604094976 | 2537144555929600 | 3089558954573824 | 2528876743884800 | 1249045209153536 | 281474976710656 | 12028879694063673 | ||
| 14 | 8276328125 | 302972250000 | 5104609600000 | 52406144000000 | 365730775040000 | 1831950142668800 | 6775163186053120 | 18729250987180032 | 38695404774096896 | 59004329431924736 | 64535834992312320 | 47938706971033600 | 21673573206720512 | 4503599627370496 | 264111366096578637 | |
| 15 | 48450468750 | 1908931750000 | 34828872800000 | 390001536000000 | 2994026373120000 | 16668206982758400 | 69388187373404160 | 219401229304856576 | 529440932110532608 | 970190231212916736 | 1328825772864962560 | 1318974148680089600 | 896779275800150016 | 373798769071751168 | 72057594037927936 | 5798945161603488510 |
Compute more
?
Technical details
- Node id
n-5ee36c18b87826bc· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-51e579a91173b2f6
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: 5, 16; 3: 30, 176, 256; 4: 175, 1520, 4352, 4096; 5: 1025, 11760, 50176, 94208, 65536; 6: 6000, 85600, 485120, 1363968, 1900544, 1048576; 7: 35125, 599200, 4234240, 15855616, 33161216, 36700160, 16777216; 8: 205625, 4082000, 34553600, 161607680, 450822144, 749731840, 687865856, 268435456; 9: 1203750, 27258000, 268838400, 1507921920, 5259329536, 11675893760, 16106127360, 12616466432, 4294967296; 10: 7046875, 179250000, 2018400000, 13201920000, 55263232000, 153490554880, 282779975680, 333128400896, 227633266688, 68719476736;
%F FormulaThe row polynomials satisfy P(n,x) = (5+16*x)*P(n-2,x) + (5+16*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 5 + 16*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 5 + 16*x;
P[n_, x_] := P[n, x] = Expand[(5 + 16*x)*P[n - 2, x] + (5 + 16*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 5 + 16*x; for(n = 3, N, my(i = n); v[i] = (5 + 16*x)*v[i - 2] + (5 + 16*x)*v[i - 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- 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 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…?
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