A026729 → basis A013610 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(4 + 3\,x\right)\,P_{n-2}(x) + \left(3\,x\right)\,P_{n-2}'(x) + \left(4 + 3\,x\right)\,P_{n-1}(x) + \left(3\,x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 4 + 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 | 4 | 3 | 7 | |||||||||||||
| 3 | 20 | 36 | 9 | 65 | ||||||||||||
| 4 | 96 | 345 | 207 | 27 | 675 | |||||||||||
| 5 | 464 | 3015 | 3303 | 999 | 81 | 7862 | ||||||||||
| 6 | 2240 | 25200 | 45180 | 23868 | 4374 | 243 | 101105 | |||||||||
| 7 | 10816 | 205617 | 569475 | 468720 | 145881 | 17982 | 729 | 1419220 | ||||||||
| 8 | 52224 | 1654887 | 6839001 | 8247609 | 3881844 | 797040 | 70713 | 2187 | 21545505 | |||||||
| 9 | 252160 | 13212648 | 79666272 | 135537705 | 90592587 | 27568593 | 4016790 | 269001 | 6561 | 351122317 | ||||||
| 10 | 1217536 | 104985897 | 909655335 | 2128724901 | 1942946838 | 822370320 | 175021965 | 19042209 | 997272 | 19683 | 6104981956 | |||||
| 11 | 5878784 | 831798903 | 10247811705 | 32403378699 | 39329418618 | 22249457622 | 6488669349 | 1019896515 | 86040954 | 3621672 | 59049 | 112666031870 | ||||
| 12 | 28385280 | 6578782560 | 114385024800 | 482389747920 | 763954158096 | 562181827266 | 215816692734 | 45964542042 | 5553886500 | 373996683 | 12931731 | 177147 | 2197240152759 | |||
| 13 | 137056256 | 51976862433 | 1268560109439 | 7066209155562 | 14396916607281 | 13514045143014 | 6644011820490 | 1841527050174 | 298871284383 | 28625951367 | 1574541585 | 45526779 | 531441 | 45112501640204 | ||
| 14 | 661766144 | 410385839559 | 14005118277369 | 102280621147983 | 265219728956478 | 312930924731451 | 193144908201768 | 67766775345072 | 14186379561372 | 1812273902199 | 140973936894 | 6453465210 | 158369418 | 1594323 | 971905365095240 | |
| 15 | 3195289600 | 3238935381144 | 154123871974056 | 1467329829106509 | 4801906819930779 | 7041304364306112 | 5374691150113071 | 2339574319947924 | 614411930866878 | 100523647997811 | 10369347828984 | 668108139030 | 25853010327 | 545258466 | 4782969 | 21908171923933660 |
Compute more
?
Technical details
- Node id
n-6365d55454edb90a· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-1b1b618dcf5c454e
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, 3; 3: 20, 36, 9; 4: 96, 345, 207, 27; 5: 464, 3015, 3303, 999, 81; 6: 2240, 25200, 45180, 23868, 4374, 243; 7: 10816, 205617, 569475, 468720, 145881, 17982, 729; 8: 52224, 1654887, 6839001, 8247609, 3881844, 797040, 70713, 2187; 9: 252160, 13212648, 79666272, 135537705, 90592587, 27568593, 4016790, 269001, 6561; 10: 1217536, 104985897, 909655335, 2128724901, 1942946838, 822370320, 175021965, 19042209, 997272, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (4+3*x)*P(n-2,x) + 3*x*d/dx P(n-2,x) + (4+3*x)*P(n-1,x) + 3*x*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 4 + 3*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[(4 + 3*x)*P[n - 2, x] + 3*x*D[P[n - 2, x], x] + (4 + 3*x)*P[n - 1, x] + 3*x*D[P[n - 1, x], 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 + 3*x; for(n = 3, N, my(i = n); v[i] = (4 + 3*x)*v[i - 2] + 3*x*deriv(v[i - 2], x) + (4 + 3*x)*v[i - 1] + 3*x*deriv(v[i - 1], x)); 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 Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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