A102537 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,n + 4\,n^{2}\right)\,P_{n}(x) = \left(-4\,n - 6\,n x + 22\,n^{2} + 18\,n^{2} x\right)\,P_{n-1}(x) + \left(-5 - 8\,x - 3\,x^{2} + 17\,n + 26\,n x + 9\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 4 | 3 | 7 | ||||||
| 3 | 21 | 32 | 12 | 65 | |||||
| 4 | 126 | 290 | 220 | 55 | 691 | ||||
| 5 | 818 | 2520 | 2886 | 1456 | 273 | 7953 | |||
| 6 | 5594 | 21595 | 33110 | 25200 | 9520 | 1428 | 96447 | ||
| 7 | 39693 | 184192 | 354008 | 360672 | 205428 | 62016 | 7752 | 1213761 | |
| 8 | 289510 | 1569330 | 3626910 | 4632390 | 3531150 | 1606374 | 403788 | 43263 | 15702715 |
Compute more
?
Technical details
- Node id
n-c37007757d9d9c3d· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-ba125e795100165f
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: 21, 32, 12; 4: 126, 290, 220, 55; 5: 818, 2520, 2886, 1456, 273; 6: 5594, 21595, 33110, 25200, 9520, 1428; 7: 39693, 184192, 354008, 360672, 205428, 62016, 7752; 8: 289510, 1569330, 3626910, 4632390, 3531150, 1606374, 403788, 43263; 9: 2157150, 13376480, 36124200, 55489280, 53023740, 32274704, 12219900, 2631200, 246675; 10: 16348960, 114139278, 352716408, 633200304, 727714020, 555216090, 281209500, 91171080, 17168580, 1430715;
%F FormulaThe row polynomials satisfy (4*n^2+2*n)*P(n,x) = (22*n^2-4*n+(18*n^2-6*n)*x)*P(n-1,x) + (17*n-5+(26*n-8)*x+(9*n-3)*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((22*n^2 - 4*n + (18*n^2 - 6*n)*x)*P[n - 1, x] + (17*n - 5 + (26*n - 8)*x + (9*n - 3)*x^2)*D[P[n - 1, x], x])/(4*n^2 + 2*n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((22*n^2 - 4*n + (18*n^2 - 6*n)*x)*v[i - 1] + (17*n - 5 + (26*n - 8)*x + (9*n - 3)*x^2)*deriv(v[i - 1], x))/(4*n^2 + 2*n)); 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
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: the reversed x = 1+q Narayana triangle at m=2.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.?
-
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
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).?
-
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
Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).?
-
from
Triangle read by rows: the reversed x = 1+q Narayana triangle at m=2.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.?
Related ?
Same fingerprint ?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.