A089627 → x ↦ x+1 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-17 - 8\,x + 9\,n + 4\,n x\right)\,P_{n-1}(x) + \left(-28 - 30\,x - 8\,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 | 1 | 1 | |||||||
| 3 | 5 | 2 | 7 | ||||||
| 4 | 13 | 6 | 19 | ||||||
| 5 | 49 | 36 | 6 | 91 | |||||
| 6 | 161 | 140 | 30 | 331 | |||||
| 7 | 581 | 630 | 210 | 20 | 1441 | ||||
| 8 | 2045 | 2562 | 1050 | 140 | 5797 | ||||
| 9 | 7393 | 10696 | 5460 | 1120 | 70 | 24739 | |||
| 10 | 26689 | 43416 | 25956 | 6720 | 630 | 103411 | |||
| 11 | 97285 | 176490 | 122220 | 39480 | 5670 | 252 | 441397 | ||
| 12 | 355565 | 710270 | 556380 | 212520 | 39270 | 2772 | 1876777 | ||
| 13 | 1305745 | 2850540 | 2497770 | 1108800 | 256410 | 27720 | 924 | 8047909 | |
| 14 | 4808545 | 11384100 | 11021010 | 5559840 | 1531530 | 216216 | 12012 | 34533253 | |
| 15 | 17760965 | 45333470 | 48078030 | 27207180 | 8738730 | 1549548 | 132132 | 3432 | 148803487 |
Compute more
?
Technical details
- Node id
n-4e15a6be7981b1f4· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-bd9a36d3d6b9d933
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 3: 5, 2; 4: 13, 6; 5: 49, 36, 6; 6: 161, 140, 30; 7: 581, 630, 210, 20; 8: 2045, 2562, 1050, 140; 9: 7393, 10696, 5460, 1120, 70; 10: 26689, 43416, 25956, 6720, 630;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (9*n-17+(4*n-8)*x)*P(n-1,x) - (28+30*x+8*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[((9*n - 17 + (4*n - 8)*x)*P[n - 1, x] - (28 + 30*x + 8*x^2)*D[P[n - 1, x], x])/(n - 1)]];
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] = ((9*n - 17 + (4*n - 8)*x)*v[i - 1] - (28 + 30*x + 8*x^2)*deriv(v[i - 1], x))/(n - 1)); 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
shift_x_plus_one of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
gamma_polynomial of narayana?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
narayana?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
narayana?
-
-
from
gamma_polynomial of narayana?
-
from
T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
-
-
from
shift_x_plus_one of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.?
Related ?
Same fingerprint ?
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