A056939 → x ↦ x+1 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(12 + 7\,n + n^{2}\right)\,P_{n}(x) = \left(12 + 27\,n + 10\,n x + 21\,n^{2} + 10\,n^{2} x\right)\,P_{n-1}(x) + \left(48 + 24\,x - 54\,n - 57\,n x - 15\,n x^{2}\right)\,P_{n-1}'(x) + \left(72 + 96\,x + 42\,x^{2} + 6\,x^{3}\right)\,P_{n-1}''(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 3 | 1 | 4 | |||||||||||||
| 2 | 13 | 8 | 1 | 22 | ||||||||||||
| 3 | 69 | 62 | 16 | 1 | 148 | |||||||||||
| 4 | 417 | 492 | 194 | 28 | 1 | 1132 | ||||||||||
| 5 | 2763 | 4035 | 2145 | 495 | 45 | 1 | 9484 | |||||||||
| 6 | 19609 | 34128 | 22850 | 7300 | 1110 | 68 | 1 | 85066 | ||||||||
| 7 | 146793 | 296548 | 239568 | 98084 | 21196 | 2268 | 98 | 1 | 804556 | |||||||
| 8 | 1146833 | 2637400 | 2496088 | 1248352 | 351736 | 54880 | 4312 | 136 | 1 | 7939738 | ||||||
| 9 | 9278595 | 23930637 | 25968414 | 15355788 | 5350296 | 1107120 | 130032 | 7734 | 183 | 1 | 81128800 | |||||
| 10 | 77292261 | 220933080 | 270423915 | 184665540 | 76774740 | 19885152 | 3149580 | 286740 | 13215 | 240 | 1 | 853424464 | ||||
| 11 | 659973933 | 2070744786 | 2822327640 | 2186382825 | 1057214070 | 329721216 | 66154572 | 8254950 | 595485 | 21670 | 308 | 1 | 9201391456 | |||
| 12 | 5756169681 | 19667422404 | 29539800378 | 25600971924 | 14123521863 | 5159416680 | 1257744708 | 201157704 | 20203095 | 1174932 | 34298 | 388 | 1 | 101327618056 | ||
| 13 | 51137399979 | 188995757535 | 310148183007 | 297367178823 | 184388100039 | 77285334555 | 22223168253 | 4356944163 | 567328905 | 46631013 | 2217501 | 52637 | 481 | 1 | 1136518296892 | |
| 14 | 461691066417 | 1835169778848 | 3266861699556 | 3433581852792 | 2364554236044 | 1119124862856 | 371306829894 | 86464354548 | 13922274366 | 1500250752 | 102282180 | 4025112 | 78624 | 588 | 1 | 12954283592578 |
Compute more
?
Technical details
- Node id
n-8010313896479d44· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-dd67c79f07eb5aef
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 0)
- 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 1; 2: 13, 8, 1; 3: 69, 62, 16, 1; 4: 417, 492, 194, 28, 1; 5: 2763, 4035, 2145, 495, 45, 1; 6: 19609, 34128, 22850, 7300, 1110, 68, 1; 7: 146793, 296548, 239568, 98084, 21196, 2268, 98, 1; 8: 1146833, 2637400, 2496088, 1248352, 351736, 54880, 4312, 136, 1; 9: 9278595, 23930637, 25968414, 15355788, 5350296, 1107120, 130032, 7734, 183, 1;
%F FormulaThe row polynomials satisfy (n^2+7*n+12)*P(n,x) = (21*n^2+27*n+12+(10*n^2+10*n)*x)*P(n-1,x) - (54*n-48+(57*n-24)*x+15*n*x^2)*d/dx P(n-1,x) + (72+96*x+42*x^2+6*x^3)*d^2/dx^2 P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((21*n^2 + 27*n + 12 + (10*n^2 + 10*n)*x)*P[n - 1, x] - (54*n - 48 + (57*n - 24)*x + 15*n*x^2)*D[P[n - 1, x], x] + (72 + 96*x + 42*x^2 + 6*x^3)*D[P[n - 1, x], {x, 2}])/(n^2 + 7*n + 12)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((21*n^2 + 27*n + 12 + (10*n^2 + 10*n)*x)*v[i - 1] - (54*n - 48 + (57*n - 24)*x + 15*n*x^2)*deriv(v[i - 1], x) + (72 + 96*x + 42*x^2 + 6*x^3)*deriv(deriv(v[i - 1], x), x))/(n^2 + 7*n + 12)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane par…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of Dyck paths counted by number of long interior inclines.?
-
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 of Dyck paths counted by number of long interior inclines.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
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
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane par…?
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023