A367270 → basis A013611 → 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(10 + 8\,x - 26\,n - 20\,n x + 16\,n^{2} + 12\,n^{2} x\right)\,P_{n-1}(x) + \left(5 + 9\,x + 4\,x^{2} - 10\,n - 18\,n x - 8\,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 | 11 | 8 | 19 | |||||
| 3 | 106 | 144 | 48 | 298 | ||||
| 4 | 1011 | 1968 | 1248 | 256 | 4483 | |||
| 5 | 9726 | 24480 | 22560 | 8960 | 1280 | 67006 | ||
| 6 | 94526 | 291120 | 350400 | 204800 | 57600 | 6144 | 1004590 | |
| 7 | 926836 | 3372768 | 5003040 | 3852800 | 1612800 | 344064 | 28672 | 15140980 |
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(-32 - 64\,x - 32\,x^{2} + 80\,n + 160\,n x + 80\,n x^{2} - 32\,n^{2} - 64\,n^{2} x - 32\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(22 + 16\,x - 48\,n - 32\,n x + 24\,n^{2} + 16\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Technical details
- Node id
n-6e441e5fd2d6315b· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-c12d924c8e8c7d11)- Fingerprint
f6-8f1a2f4c2ea52b05
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: 11, 8; 3: 106, 144, 48; 4: 1011, 1968, 1248, 256; 5: 9726, 24480, 22560, 8960, 1280; 6: 94526, 291120, 350400, 204800, 57600, 6144; 7: 926836, 3372768, 5003040, 3852800, 1612800, 344064, 28672; 8: 9153731, 38411744, 67679808, 64637440, 35929600, 11526144, 1949696, 131072; 9: 90941686, 432191808, 881633088, 1004806656, 696568320, 298819584, 76726272, 10616832, 589824;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (16*n^2-26*n+10+(12*n^2-20*n+8)*x)*P(n-1,x) - (10*n-5+(18*n-9)*x+(8*n-4)*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[((16*n^2 - 26*n + 10 + (12*n^2 - 20*n + 8)*x)*P[n - 1, x] - (10*n - 5 + (18*n - 9)*x + (8*n - 4)*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] = ((16*n^2 - 26*n + 10 + (12*n^2 - 20*n + 8)*x)*v[i - 1] - (10*n - 5 + (18*n - 9)*x + (8*n - 4)*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_A013611 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_A013611 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