A026729 → basis A013610 → basis A013610
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4 + 9\,x\right)\,P_{n-2}(x) + \left(4 + 9\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 4 + 9\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 4 | 9 | 13 | |||||||||||||
| 3 | 20 | 81 | 81 | 182 | ||||||||||||
| 4 | 96 | 576 | 1134 | 729 | 2535 | |||||||||||
| 5 | 464 | 3672 | 10773 | 13851 | 6561 | 35321 | ||||||||||
| 6 | 2240 | 22032 | 85860 | 165483 | 157464 | 59049 | 492128 | |||||||||
| 7 | 10816 | 127152 | 617868 | 1587033 | 2270106 | 1712421 | 531441 | 6856837 | ||||||||
| 8 | 52224 | 714240 | 4157568 | 13343616 | 25482924 | 28934010 | 18068994 | 4782969 | 95536545 | |||||||
| 9 | 252160 | 3932928 | 26674272 | 102701520 | 245387961 | 372362994 | 350219619 | 186535791 | 43046721 | 1331113966 | ||||||
| 10 | 1217536 | 21328128 | 165151872 | 741667104 | 2127889764 | 4043025981 | 5084827488 | 4079872557 | 1894055724 | 387420489 | 18546456643 | |||||
| 11 | 5878784 | 114271488 | 994654080 | 5103909792 | 17092428516 | 39021055425 | 61478689203 | 65981057355 | 46146084912 | 18983603961 | 3486784401 | 258408417917 | ||||
| 12 | 28385280 | 606265344 | 5859620352 | 33820561152 | 129491465184 | 345239190144 | 653830799418 | 879315369867 | 822708931752 | 509845363524 | 188286357654 | 31381059609 | 3600413369280 | |||
| 13 | 137056256 | 3190523904 | 33901929216 | 217386353664 | 936655813296 | 2856296025576 | 6319580164605 | 10218971106477 | 11983087911654 | 9935011019916 | 5526553275585 | 1851482516931 | 282429536481 | 50164683233561 | ||
| 14 | 661766144 | 16676130816 | 193217301504 | 1362681605376 | 6525451347264 | 22401466369200 | 56707460797572 | 107153844581583 | 151107765660720 | 157031597124414 | 116863065983916 | 58965011005311 | 18075490334784 | 2541865828329 | 698946255836933 | |
| 15 | 3195289600 | 86656020480 | 1087276815360 | 8364344912640 | 44069040273600 | 168190014024144 | 479428025401692 | 1036734631411833 | 1708718755482036 | 2135684114728686 | 1992257950336974 | 1344772547424477 | 620780121185238 | 175388742154701 | 22876792454961 | 9738442207916422 |
Compute more
?
Technical details
- Node id
n-49ce00b369a48d4f· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-ddf9755062ce883a
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, 9; 3: 20, 81, 81; 4: 96, 576, 1134, 729; 5: 464, 3672, 10773, 13851, 6561; 6: 2240, 22032, 85860, 165483, 157464, 59049; 7: 10816, 127152, 617868, 1587033, 2270106, 1712421, 531441; 8: 52224, 714240, 4157568, 13343616, 25482924, 28934010, 18068994, 4782969; 9: 252160, 3932928, 26674272, 102701520, 245387961, 372362994, 350219619, 186535791, 43046721; 10: 1217536, 21328128, 165151872, 741667104, 2127889764, 4043025981, 5084827488, 4079872557, 1894055724, 387420489;
%F FormulaThe row polynomials satisfy P(n,x) = (4+9*x)*P(n-2,x) + (4+9*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 4 + 9*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 4 + 9*x;
P[n_, x_] := P[n, x] = Expand[(4 + 9*x)*P[n - 2, x] + (4 + 9*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] = 4 + 9*x; for(n = 3, N, my(i = n); v[i] = (4 + 9*x)*v[i - 2] + (4 + 9*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_A013610 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_A013610 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