A367270 → basis A013609 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-n + 2\,n x + 5\,n^{2} - 14\,n^{2} x - 8\,n^{3} + 36\,n^{3} x - 4\,n^{3} x^{2} + 4\,n^{4} - 36\,n^{4} x + 12\,n^{4} x^{2} + 12\,n^{5} x - 12\,n^{5} x^{2} + 4\,n^{6} x^{2}\right)\,P_{n}(x) = \left(2 + 12\,x + 24\,x^{2} + 16\,x^{3} - 14\,n - 68\,n x - 108\,n x^{2} - 40\,n x^{3} + 36\,n^{2} + 120\,n^{2} x + 88\,n^{2} x^{2} - 40\,n^{3} - 40\,n^{3} x + 136\,n^{3} x^{2} + 72\,n^{3} x^{3} + 16\,n^{4} - 72\,n^{4} x - 220\,n^{4} x^{2} - 48\,n^{4} x^{3} + 48\,n^{5} x + 64\,n^{5} x^{2} - 24\,n^{5} x^{3} + 16\,n^{6} x^{2} + 24\,n^{6} x^{3}\right)\,P_{n-1}(x) + \left(x + 6\,x^{2} + 12\,x^{3} + 8\,x^{4} - 6\,n x - 28\,n x^{2} - 40\,n x^{3} - 16\,n x^{4} + 12\,n^{2} x + 32\,n^{2} x^{2} + 12\,n^{2} x^{3} - 8\,n^{2} x^{4} - 8\,n^{3} x + 8\,n^{3} x^{2} + 64\,n^{3} x^{3} + 32\,n^{3} x^{4} - 24\,n^{4} x^{2} - 52\,n^{4} x^{3} - 8\,n^{4} x^{4} - 8\,n^{5} x^{3} - 16\,n^{5} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||||||||
| 1 | 1 | 1 | |||||||||||||
| 2 | 3 | 16 | 19 | ||||||||||||
| 3 | 10 | 96 | 108 | 214 | |||||||||||
| 4 | 35 | 480 | 1080 | 512 | 2107 | ||||||||||
| 5 | 126 | 2240 | 7560 | 7680 | 2000 | 19606 | |||||||||
| 6 | 462 | 10080 | 45360 | 71680 | 42000 | 6912 | 176494 | ||||||||
| 7 | 1716 | 44352 | 249480 | 537600 | 504000 | 193536 | 21952 | 1552636 | |||||||
| 8 | 6435 | 192192 | 1297296 | 3548160 | 4620000 | 2903040 | 790272 | 65536 | 13422931 | ||||||
| 9 | 24310 | 823680 | 6486480 | 21525504 | 36036000 | 31933440 | 14488320 | 2949120 | 186624 | 114453478 | |||||
| 10 | 92378 | 3500640 | 31505760 | 123002880 | 252252000 | 290594304 | 188348160 | 64880640 | 10264320 | 512000 | 964953082 | ||||
| 11 | 352716 | 14780480 | 149652360 | 672122880 | 1633632000 | 2324754432 | 1977655680 | 984023040 | 266872320 | 33792000 | 1362944 | 8059000852 | |||
| 12 | 1352078 | 62078016 | 698377680 | 3547315200 | 9976824000 | 16937496576 | 17930744832 | 11808276480 | 4670265600 | 1025024000 | 106309632 | 3538944 | 66767603038 | ||
| 13 | 5200300 | 259598976 | 3212537328 | 18209551360 | 58198140000 | 114933012480 | 146007493632 | 120444420096 | 63515612160 | 20500480000 | 3720837120 | 322043904 | 8998912 | 549337926268 | |
| 14 | 20058300 | 1081662400 | 14602442400 | 91378839552 | 327202876000 | 737486830080 | 1095056202240 | 1089735229440 | 724077978624 | 313657344000 | 84338974720 | 12881756160 | 944885760 | 22478848 | 4492487558524 |
Compute more
?
Technical details
- Node id
n-eba6e6c2bf83470e· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-b9c4940a2f76c6c3
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: 3, 16; 3: 10, 96, 108; 4: 35, 480, 1080, 512; 5: 126, 2240, 7560, 7680, 2000; 6: 462, 10080, 45360, 71680, 42000, 6912; 7: 1716, 44352, 249480, 537600, 504000, 193536, 21952; 8: 6435, 192192, 1297296, 3548160, 4620000, 2903040, 790272, 65536; 9: 24310, 823680, 6486480, 21525504, 36036000, 31933440, 14488320, 2949120, 186624;
%F FormulaThe row polynomials satisfy (4*n^4-8*n^3+5*n^2-n+(12*n^5-36*n^4+36*n^3-14*n^2+2*n)*x+(4*n^6-12*n^5+12*n^4-4*n^3)*x^2)*P(n,x) = (16*n^4-40*n^3+36*n^2-14*n+2+(48*n^5-72*n^4-40*n^3+120*n^2-68*n+12)*x+(16*n^6+64*n^5-220*n^4+136*n^3+88*n^2-108*n+24)*x^2+(24*n^6-24*n^5-48*n^4+72*n^3-40*n+16)*x^3)*P(n-1,x) - ((8*n^3-12*n^2+6*n-1)*x+(24*n^4-8*n^3-32*n^2+28*n-6)*x^2+(8*n^5+52*n^4-64*n^3-12*n^2+40*n-12)*x^3+(16*n^5+8*n^4-32*n^3+8*n^2+16*n-8)*x^4)*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^4 - 40*n^3 + 36*n^2 - 14*n + 2 + (48*n^5 - 72*n^4 - 40*n^3 + 120*n^2 - 68*n + 12)*x + (16*n^6 + 64*n^5 - 220*n^4 + 136*n^3 + 88*n^2 - 108*n + 24)*x^2 + (24*n^6 - 24*n^5 - 48*n^4 + 72*n^3 - 40*n + 16)*x^3)*P[n - 1, x] - ((8*n^3 - 12*n^2 + 6*n - 1)*x + (24*n^4 - 8*n^3 - 32*n^2 + 28*n - 6)*x^2 + (8*n^5 + 52*n^4 - 64*n^3 - 12*n^2 + 40*n - 12)*x^3 + (16*n^5 + 8*n^4 - 32*n^3 + 8*n^2 + 16*n - 8)*x^4)*D[P[n - 1, x], x])/(4*n^4 - 8*n^3 + 5*n^2 - n + (12*n^5 - 36*n^4 + 36*n^3 - 14*n^2 + 2*n)*x + (4*n^6 - 12*n^5 + 12*n^4 - 4*n^3)*x^2)]];
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^4 - 40*n^3 + 36*n^2 - 14*n + 2 + (48*n^5 - 72*n^4 - 40*n^3 + 120*n^2 - 68*n + 12)*x + (16*n^6 + 64*n^5 - 220*n^4 + 136*n^3 + 88*n^2 - 108*n + 24)*x^2 + (24*n^6 - 24*n^5 - 48*n^4 + 72*n^3 - 40*n + 16)*x^3)*v[i - 1] - ((8*n^3 - 12*n^2 + 6*n - 1)*x + (24*n^4 - 8*n^3 - 32*n^2 + 28*n - 6)*x^2 + (8*n^5 + 52*n^4 - 64*n^3 - 12*n^2 + 40*n - 12)*x^3 + (16*n^5 + 8*n^4 - 32*n^3 + 8*n^2 + 16*n - 8)*x^4)*deriv(v[i - 1], x))/(4*n^4 - 8*n^3 + 5*n^2 - n + (12*n^5 - 36*n^4 + 36*n^3 - 14*n^2 + 2*n)*x + (4*n^6 - 12*n^5 + 12*n^4 - 4*n^3)*x^2)); 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013609 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_A013609 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