A008288 → basis A013610 → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4 + 3\,x\right)\,P_{n-2}(x) + \left(5 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 5 + 3\,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 | 3 | 8 | |||||||||||||
| 3 | 29 | 33 | 9 | 71 | ||||||||||||
| 4 | 165 | 279 | 153 | 27 | 624 | |||||||||||
| 5 | 941 | 2109 | 1737 | 621 | 81 | 5489 | ||||||||||
| 6 | 5365 | 14979 | 16461 | 8883 | 2349 | 243 | 48280 | |||||||||
| 7 | 30589 | 102249 | 140517 | 101493 | 40581 | 8505 | 729 | 424663 | ||||||||
| 8 | 174405 | 679023 | 1120113 | 1013931 | 543429 | 172287 | 29889 | 2187 | 3735264 | |||||||
| 9 | 994381 | 4419093 | 8506449 | 9257517 | 6225741 | 2647485 | 694737 | 102789 | 6561 | 32854753 | ||||||
| 10 | 5669525 | 28317915 | 62307045 | 79222995 | 64116765 | 34234083 | 12052557 | 2696571 | 347733 | 19683 | 288984872 | |||||
| 11 | 32325149 | 179257665 | 443772045 | 645585525 | 610928325 | 392787873 | 173686437 | 52135893 | 10162989 | 1161297 | 59049 | 2541862247 | ||||
| 12 | 184303845 | 1123544007 | 3090815145 | 5063056875 | 5485534245 | 4126010967 | 2197708281 | 828682731 | 216703269 | 37417383 | 3838185 | 177147 | 22357792080 | |||
| 13 | 1050819821 | 6984637677 | 21137568921 | 38501388045 | 46997311725 | 40490594037 | 25239683673 | 11466141381 | 3766624173 | 872330877 | 135163161 | 12577437 | 531441 | 196655372369 | ||
| 14 | 5991314485 | 43122735411 | 142375650237 | 285444319923 | 387622030365 | 376405551963 | 268839066501 | 142957613691 | 56584406277 | 16461306243 | 3420413325 | 480599811 | 40920957 | 1594323 | 1729747523512 | |
| 15 | 34159851709 | 264678630681 | 946750646133 | 2071766809269 | 3097936522629 | 3347848162233 | 2695842505197 | 1642888884501 | 761259793293 | 266848946073 | 69643630629 | 13120038261 | 1686262293 | 132328809 | 4782969 | 15214567794679 |
Compute more
?
Technical details
- Node id
n-1de02a93ec464eb7· revision 0 · JSON- Definition source
derived:basis_map_A007318- Fingerprint
f6-32e041d93e8340e1
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, 3; 3: 29, 33, 9; 4: 165, 279, 153, 27; 5: 941, 2109, 1737, 621, 81; 6: 5365, 14979, 16461, 8883, 2349, 243; 7: 30589, 102249, 140517, 101493, 40581, 8505, 729; 8: 174405, 679023, 1120113, 1013931, 543429, 172287, 29889, 2187; 9: 994381, 4419093, 8506449, 9257517, 6225741, 2647485, 694737, 102789, 6561; 10: 5669525, 28317915, 62307045, 79222995, 64116765, 34234083, 12052557, 2696571, 347733, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (4+3*x)*P(n-2,x) + (5+3*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 5 + 3*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 5 + 3*x;
P[n_, x_] := P[n, x] = Expand[(4 + 3*x)*P[n - 2, x] + (5 + 3*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 + 3*x; for(n = 3, N, my(i = n); v[i] = (4 + 3*x)*v[i - 2] + (5 + 3*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 ?
Candidate equalities ?
- A008288 → basis A013610 → x ↦ x+1 15 rows; no all-index equality certificate was found
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