A026729 → basis A008277 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(2 + x\right)\,P_{n-2}(x) + \left(1 + x\right)\,P_{n-2}'(x) + \left(2 + x\right)\,P_{n-1}(x) + \left(1 + x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 2 | 1 | 3 | |||||||||||||
| 3 | 7 | 6 | 1 | 14 | ||||||||||||
| 4 | 25 | 32 | 11 | 1 | 69 | |||||||||||
| 5 | 102 | 170 | 89 | 17 | 1 | 379 | ||||||||||
| 6 | 456 | 933 | 656 | 194 | 24 | 1 | 2264 | |||||||||
| 7 | 2219 | 5357 | 4716 | 1900 | 366 | 32 | 1 | 14591 | ||||||||
| 8 | 11640 | 32289 | 34060 | 17402 | 4599 | 627 | 41 | 1 | 100659 | |||||||
| 9 | 65364 | 204349 | 250656 | 155146 | 52387 | 9830 | 1002 | 51 | 1 | 738786 | ||||||
| 10 | 390646 | 1356350 | 1893146 | 1375400 | 566749 | 136443 | 19165 | 1519 | 62 | 1 | 5739481 | |||||
| 11 | 2472719 | 9425711 | 14727545 | 12273076 | 5976727 | 1764049 | 318599 | 34801 | 2209 | 74 | 1 | 46995511 | ||||
| 12 | 16508791 | 68450930 | 118210253 | 111036975 | 62411792 | 21873504 | 4856844 | 682812 | 59705 | 3106 | 87 | 1 | 404094800 | |||
| 13 | 115839661 | 518487029 | 979557986 | 1023042129 | 651828930 | 264904048 | 70064388 | 12129272 | 1365373 | 97774 | 4247 | 101 | 1 | 3637320939 | ||
| 14 | 851634863 | 4088698807 | 8380248227 | 9625126647 | 6853411196 | 3171210978 | 975831996 | 201630612 | 27970784 | 2578098 | 154010 | 5672 | 116 | 1 | 34178502007 | |
| 15 | 6542134884 | 33508644458 | 73990917016 | 92621610597 | 72860184662 | 37833423612 | 13299605286 | 3204424596 | 531204302 | 60353319 | 4638459 | 234710 | 7424 | 132 | 1 | 334457383458 |
Compute more
?
Technical details
- Node id
n-5850d1b617b606a6· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-af694739d2ce3984
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: 2, 1; 3: 7, 6, 1; 4: 25, 32, 11, 1; 5: 102, 170, 89, 17, 1; 6: 456, 933, 656, 194, 24, 1; 7: 2219, 5357, 4716, 1900, 366, 32, 1; 8: 11640, 32289, 34060, 17402, 4599, 627, 41, 1; 9: 65364, 204349, 250656, 155146, 52387, 9830, 1002, 51, 1; 10: 390646, 1356350, 1893146, 1375400, 566749, 136443, 19165, 1519, 62, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (2+x)*P(n-2,x) + (1+x)*d/dx P(n-2,x) + (2+x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 2, x] + (1 + x)*D[P[n - 2, x], x] + (2 + x)*P[n - 1, x] + (1 + 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] = 2 + x; for(n = 3, N, my(i = n); v[i] = (2 + x)*v[i - 2] + (1 + x)*deriv(v[i - 2], x) + (2 + x)*v[i - 1] + (1 + 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
-
from
basis_map_A008277 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