A008288 → basis A013610 → basis A013611
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4 + 12\,x\right)\,P_{n-2}(x) + \left(5 + 12\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 5 + 12\,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 | 12 | 17 | |||||||||||||
| 3 | 29 | 132 | 144 | 305 | ||||||||||||
| 4 | 165 | 1116 | 2448 | 1728 | 5457 | |||||||||||
| 5 | 941 | 8436 | 27792 | 39744 | 20736 | 97649 | ||||||||||
| 6 | 5365 | 59916 | 263376 | 568512 | 601344 | 248832 | 1747345 | |||||||||
| 7 | 30589 | 408996 | 2248272 | 6495552 | 10388736 | 8709120 | 2985984 | 31267249 | ||||||||
| 8 | 174405 | 2716092 | 17921808 | 64891584 | 139117824 | 176421888 | 122425344 | 35831808 | 559500753 | |||||||
| 9 | 994381 | 17676372 | 136103184 | 592481088 | 1593789696 | 2711024640 | 2845642752 | 1684094976 | 429981696 | 10011788785 | ||||||
| 10 | 5669525 | 113271660 | 996912720 | 5070271680 | 16413891840 | 35055700992 | 49367273472 | 44180619264 | 22789029888 | 5159780352 | 179152421393 | |||||
| 11 | 32325149 | 717030660 | 7100352720 | 41317473600 | 156397651200 | 402214781952 | 711419645952 | 854194470912 | 666041647104 | 304427040768 | 61917364224 | 3205779784241 | ||||
| 12 | 184303845 | 4494176028 | 49453042320 | 324035640000 | 1404296766720 | 4225035230208 | 9001813118976 | 13577137864704 | 14201865437184 | 9808742449152 | 4024628674560 | 743008370688 | 57364695074385 | |||
| 13 | 1050819821 | 27938550708 | 338201102736 | 2464088834880 | 12031311801600 | 41462368293888 | 103381744324608 | 187861260386304 | 246849481801728 | 228676305420288 | 141728846708736 | 52753594318848 | 8916100448256 | 1026492292812401 | ||
| 14 | 5991314485 | 172490941644 | 2278010403792 | 18268436475072 | 99231239773440 | 385439285210112 | 1101164816388096 | 2342217542713344 | 3708315649769472 | 4315232663764992 | 3586563322675200 | 2015781709676544 | 686539734515712 | 106993205379072 | 18368204099000977 | |
| 15 | 34159851709 | 1058714522724 | 15148010338128 | 132593075793216 | 793071749793024 | 3428196518126592 | 11042170901286912 | 26917091483664384 | 49889921813250048 | 69952850119360512 | 73026639630434304 | 55029428958265344 | 28290786722316288 | 8880436046462976 | 1283918464548864 | 328683346368015025 |
Compute more
?
Technical details
- Node id
n-43c399e2a98269df· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-eff727d82afb07a1
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, 12; 3: 29, 132, 144; 4: 165, 1116, 2448, 1728; 5: 941, 8436, 27792, 39744, 20736; 6: 5365, 59916, 263376, 568512, 601344, 248832; 7: 30589, 408996, 2248272, 6495552, 10388736, 8709120, 2985984; 8: 174405, 2716092, 17921808, 64891584, 139117824, 176421888, 122425344, 35831808; 9: 994381, 17676372, 136103184, 592481088, 1593789696, 2711024640, 2845642752, 1684094976, 429981696; 10: 5669525, 113271660, 996912720, 5070271680, 16413891840, 35055700992, 49367273472, 44180619264, 22789029888, 5159780352;
%F FormulaThe row polynomials satisfy P(n,x) = (4+12*x)*P(n-2,x) + (5+12*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 5 + 12*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 5 + 12*x;
P[n_, x_] := P[n, x] = Expand[(4 + 12*x)*P[n - 2, x] + (5 + 12*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 + 12*x; for(n = 3, N, my(i = n); v[i] = (4 + 12*x)*v[i - 2] + (5 + 12*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 Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
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
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ 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
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ 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
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…?
-
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…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
-
from
basis_map_A013610 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
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