A367270 → basis A013610 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-n + n^{2}\right)\,P_{n}(x) = \left(8 + 6\,x - 21\,n - 15\,n x + 13\,n^{2} + 9\,n^{2} x\right)\,P_{n-1}(x) + \left(4 + 7\,x + 3\,x^{2} - 8\,n - 14\,n x - 6\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||
| 1 | 1 | 1 | ||||||
| 2 | 9 | 6 | 15 | |||||
| 3 | 73 | 90 | 27 | 190 | ||||
| 4 | 593 | 1044 | 594 | 108 | 2339 | |||
| 5 | 4881 | 11100 | 9180 | 3240 | 405 | 28806 | ||
| 6 | 40665 | 113130 | 122310 | 63720 | 15795 | 1458 | 357078 | |
| 7 | 342105 | 1124550 | 1499715 | 1031940 | 382725 | 71442 | 5103 | 4457580 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(\left(-3\,n + 2\,n^{2}\right)\,P_{n}(x) = \left(-18 - 36\,x - 18\,x^{2} + 45\,n + 90\,n x + 45\,n x^{2} - 18\,n^{2} - 36\,n^{2} x - 18\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(18 + 12\,x - 40\,n - 24\,n x + 20\,n^{2} + 12\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Technical details
- Node id
n-4b3c71e576f04d69· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-b3a592a78406eb38)- Fingerprint
f6-4cbc0e728e3582be
Observed on the stored rows ?
- Degrees: 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (irregular)
- 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: 1; 2: 9, 6; 3: 73, 90, 27; 4: 593, 1044, 594, 108; 5: 4881, 11100, 9180, 3240, 405; 6: 40665, 113130, 122310, 63720, 15795, 1458; 7: 342105, 1124550, 1499715, 1031940, 382725, 71442, 5103; 8: 2900385, 10994760, 17429580, 14900760, 7365330, 2082024, 306180, 17496; 9: 24742945, 106234200, 195093360, 199311840, 123186420, 46784304, 10532592, 1259712, 59049;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (13*n^2-21*n+8+(9*n^2-15*n+6)*x)*P(n-1,x) - (8*n-4+(14*n-7)*x+(6*n-3)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((13*n^2 - 21*n + 8 + (9*n^2 - 15*n + 6)*x)*P[n - 1, x] - (8*n - 4 + (14*n - 7)*x + (6*n - 3)*x^2)*D[P[n - 1, x], x])/(n^2 - n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((13*n^2 - 21*n + 8 + (9*n^2 - 15*n + 6)*x)*v[i - 1] - (8*n - 4 + (14*n - 7)*x + (6*n - 3)*x^2)*deriv(v[i - 1], x))/(n^2 - n)); 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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, 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 read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
-
-
from
basis_map_A013610 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).?
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