A143494 → θ+1 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-5 - 4\,x - x^{2}\right)\,P_{n-2}(x) + \left(-2 - 3\,x - x^{2}\right)\,P_{n-2}'(x) + \left(5 + 2\,x\right)\,P_{n-1}(x) + \left(1 + x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 4 + 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 | 4 | 2 | 6 | |||||||||||||
| 3 | 17 | 16 | 3 | 36 | ||||||||||||
| 4 | 77 | 104 | 39 | 4 | 224 | |||||||||||
| 5 | 372 | 648 | 363 | 76 | 5 | 1464 | ||||||||||
| 6 | 1915 | 4062 | 3015 | 960 | 130 | 6 | 10088 | |||||||||
| 7 | 10481 | 26108 | 24048 | 10300 | 2140 | 204 | 7 | 73288 | ||||||||
| 8 | 60814 | 173490 | 190302 | 102424 | 28875 | 4242 | 301 | 8 | 560456 | |||||||
| 9 | 372939 | 1196192 | 1519017 | 983780 | 351365 | 70392 | 7714 | 424 | 9 | 4501832 | ||||||
| 10 | 2409837 | 8568680 | 12340713 | 9333496 | 4041240 | 1031058 | 154518 | 13128 | 576 | 10 | 37893256 | |||||
| 11 | 16360786 | 63775820 | 102557073 | 88620220 | 45110840 | 14025060 | 2685459 | 312480 | 21195 | 760 | 11 | 333469704 | ||||
| 12 | 116393205 | 492938998 | 874309755 | 848907444 | 496676455 | 182446242 | 42719061 | 6363456 | 591525 | 32780 | 979 | 12 | 3061379912 | |||
| 13 | 865549453 | 3953161912 | 7657679604 | 8245896824 | 5450100700 | 2311896048 | 641869690 | 117188544 | 13960683 | 1060400 | 48917 | 1236 | 13 | 29258414024 | ||
| 14 | 6713065156 | 32859105762 | 68955831360 | 81486023216 | 60017556170 | 28886507364 | 9294359074 | 2017136264 | 294948225 | 28725840 | 1815957 | 70824 | 1534 | 14 | 290555146760 | |
| 15 | 54190360453 | 282774216080 | 638525885091 | 820927472456 | 666412959030 | 358879280760 | 131470110772 | 33153073096 | 5772241332 | 690589900 | 55984929 | 2990988 | 99918 | 1876 | 15 | 2992855266696 |
Compute more
?
Technical details
- Node id
n-53b59547a77aa9a8· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-97b1acff54b6a7ed
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, 2; 3: 17, 16, 3; 4: 77, 104, 39, 4; 5: 372, 648, 363, 76, 5; 6: 1915, 4062, 3015, 960, 130, 6; 7: 10481, 26108, 24048, 10300, 2140, 204, 7; 8: 60814, 173490, 190302, 102424, 28875, 4242, 301, 8; 9: 372939, 1196192, 1519017, 983780, 351365, 70392, 7714, 424, 9; 10: 2409837, 8568680, 12340713, 9333496, 4041240, 1031058, 154518, 13128, 576, 10;
%F FormulaThe row polynomials satisfy P(n,x) = -(5+4*x+x^2)*P(n-2,x) - (2+3*x+x^2)*d/dx P(n-2,x) + (5+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) = 4 + 2*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 4 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(5 + 4*x + x^2)*P[n - 2, x] - (2 + 3*x + x^2)*D[P[n - 2, x], x] + (5 + 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] = 4 + 2*x; for(n = 3, N, my(i = n); v[i] = -(5 + 4*x + x^2)*v[i - 2] - (2 + 3*x + x^2)*deriv(v[i - 2], x) + (5 + 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
theta_plus_one of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Ray basis map theorem (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: 2-Stirling numbers of the second kind.?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.