A391045 → θ+1 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + 8\,n - 10\,n^{2} + 4\,n^{3}\right)\,P_{n}(x) = \left(-54 - 52\,x + 160\,n + 152\,n x - 142\,n^{2} - 132\,n^{2} x + 40\,n^{3} + 36\,n^{3} x\right)\,P_{n-1}(x) + \left(-54 - 116\,x - 62\,x^{2} + 116\,n + 250\,n x + 134\,n x^{2} - 44\,n^{2} - 96\,n^{2} x - 52\,n^{2} x^{2}\right)\,P_{n-1}'(x) + \left(-9 - 30\,x - 33\,x^{2} - 12\,x^{3} + 15\,n + 50\,n x + 55\,n x^{2} + 20\,n x^{3}\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 3 | 2 | 5 | |||||||||||||
| 3 | 12 | 14 | 3 | 29 | ||||||||||||
| 4 | 53 | 90 | 42 | 4 | 189 | |||||||||||
| 5 | 244 | 544 | 396 | 100 | 5 | 1289 | ||||||||||
| 6 | 1152 | 3180 | 3150 | 1320 | 205 | 6 | 9013 | |||||||||
| 7 | 5531 | 18204 | 22830 | 13460 | 3675 | 378 | 7 | 64085 | ||||||||
| 8 | 26875 | 102718 | 155946 | 118860 | 47110 | 8988 | 644 | 8 | 461149 | |||||||
| 9 | 131760 | 573528 | 1022364 | 956928 | 500080 | 142632 | 19908 | 1032 | 9 | 3348241 | ||||||
| 10 | 650492 | 3176712 | 6503328 | 7222320 | 4698540 | 1800288 | 386148 | 40752 | 1575 | 10 | 24480165 | |||||
| 11 | 3229368 | 17484640 | 40423320 | 51969240 | 40517190 | 19578888 | 5742660 | 955680 | 78210 | 2310 | 11 | 179981517 | ||||
| 12 | 16105344 | 95745496 | 246715260 | 360462960 | 327831570 | 191675484 | 71789256 | 16614840 | 2196315 | 142230 | 3278 | 12 | 1329282045 | |||
| 13 | 80624935 | 522097272 | 1483647924 | 2428333160 | 2525096970 | 1734959952 | 793501632 | 237312504 | 44330715 | 4741880 | 247104 | 4524 | 13 | 9854898585 | ||
| 14 | 404913225 | 2836942862 | 8813510316 | 15975454352 | 18701172490 | 14777390628 | 7999019028 | 2947291776 | 719601597 | 110434610 | 9704266 | 412776 | 6097 | 14 | 73295854037 | |
| 15 | 2039146908 | 15368964758 | 51819909687 | 103051079040 | 134140746740 | 119894570796 | 75060411426 | 32957794584 | 9998773785 | 2027595570 | 259316057 | 18958212 | 666393 | 8050 | 15 | 546637942021 |
Compute more
?
Technical details
- Node id
n-cabbdb9e098455ef· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-a33a1afd14740aa7
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: 3, 2; 3: 12, 14, 3; 4: 53, 90, 42, 4; 5: 244, 544, 396, 100, 5; 6: 1152, 3180, 3150, 1320, 205, 6; 7: 5531, 18204, 22830, 13460, 3675, 378, 7; 8: 26875, 102718, 155946, 118860, 47110, 8988, 644, 8; 9: 131760, 573528, 1022364, 956928, 500080, 142632, 19908, 1032, 9; 10: 650492, 3176712, 6503328, 7222320, 4698540, 1800288, 386148, 40752, 1575, 10;
%F FormulaThe row polynomials satisfy (4*n^3-10*n^2+8*n-2)*P(n,x) = (40*n^3-142*n^2+160*n-54+(36*n^3-132*n^2+152*n-52)*x)*P(n-1,x) - (44*n^2-116*n+54+(96*n^2-250*n+116)*x+(52*n^2-134*n+62)*x^2)*d/dx P(n-1,x) + (15*n-9+(50*n-30)*x+(55*n-33)*x^2+(20*n-12)*x^3)*d^2/dx^2 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[((40*n^3 - 142*n^2 + 160*n - 54 + (36*n^3 - 132*n^2 + 152*n - 52)*x)*P[n - 1, x] - (44*n^2 - 116*n + 54 + (96*n^2 - 250*n + 116)*x + (52*n^2 - 134*n + 62)*x^2)*D[P[n - 1, x], x] + (15*n - 9 + (50*n - 30)*x + (55*n - 33)*x^2 + (20*n - 12)*x^3)*D[P[n - 1, x], {x, 2}])/(4*n^3 - 10*n^2 + 8*n - 2)]];
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] = ((40*n^3 - 142*n^2 + 160*n - 54 + (36*n^3 - 132*n^2 + 152*n - 52)*x)*v[i - 1] - (44*n^2 - 116*n + 54 + (96*n^2 - 250*n + 116)*x + (52*n^2 - 134*n + 62)*x^2)*deriv(v[i - 1], x) + (15*n - 9 + (50*n - 30)*x + (55*n - 33)*x^2 + (20*n - 12)*x^3)*deriv(deriv(v[i - 1], x), x))/(4*n^3 - 10*n^2 + 8*n - 2)); 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: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
- ↑ 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
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
-
from
reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
-
-
from
theta_plus_one of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.?
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