A109692 → basis A007318 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-3 + 2\,n\right)\,P_{n}(x) = \left(4 + 12\,x + 9\,x^{2} - 16\,n - 44\,n x - 30\,n x^{2} + 20\,n^{2} + 48\,n^{2} x + 28\,n^{2} x^{2} - 8\,n^{3} - 16\,n^{3} x - 8\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(2 + 6\,x - 12\,n - 16\,n x + 8\,n^{2} + 8\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 2 | 4 | |||||||||||||
| 2 | 8 | 20 | 9 | 37 | ||||||||||||
| 3 | 48 | 200 | 204 | 60 | 512 | |||||||||||
| 4 | 384 | 2272 | 3732 | 2384 | 525 | 9297 | ||||||||||
| 5 | 3840 | 29632 | 67992 | 68624 | 32070 | 5670 | 207828 | |||||||||
| 6 | 46080 | 440064 | 1304832 | 1820704 | 1328420 | 491364 | 72765 | 5504229 | ||||||||
| 7 | 645120 | 7358976 | 26848896 | 48106944 | 48184320 | 27602448 | 8471064 | 1081080 | 168298848 | |||||||
| 8 | 10321920 | 137097216 | 595159296 | 1306689024 | 1672954320 | 1308956928 | 618579864 | 162515520 | 18243225 | 5830517313 | ||||||
| 9 | 185794560 | 2818695168 | 14208846336 | 37010679808 | 57880319520 | 57689492832 | 37095416624 | 14943402432 | 3436487370 | 344594250 | 225613728900 | |||||
| 10 | 3715891200 | 63434096640 | 364509739008 | 1100171036672 | 2036610035840 | 2473461141696 | 2020692090256 | 1104368523904 | 388144974384 | 79439951700 | 7202019825 | 9641749501125 | ||||
| 11 | 81749606400 | 1551617556480 | 10017388302336 | 34410035499008 | 73684910501120 | 105738718020480 | 105055023957184 | 72792717692032 | 34629895813680 | 10804395006360 | 1993507320420 | 164991726900 | 450924951002400 | |||
| 12 | 1961990553600 | 40999303249920 | 293948124954624 | 1133040759914496 | 2757726372623360 | 4571432762322432 | 5358642841855296 | 4508471568626176 | 2714629069809648 | 1144291706502240 | 321195369350988 | 53978712394320 | 4111043861925 | 22904429626019025 | ||
| 13 | 51011754393600 | 1164081412177920 | 9180125120692224 | 39257330589597696 | 107108409435535360 | 201589042999084032 | 272658169455975296 | 270324341980146176 | 197381118682662048 | 105157947419326240 | 39819101531937288 | 10163320231824720 | 1568810601089550 | 110681950128750 | 1255533493164570900 | |
| 14 | 1428329123020800 | 35348914278236160 | 304188800572588032 | 1429689760853655552 | 4323970371593912320 | 9114805669685698560 | 13984483599238455296 | 15982533661514187776 | 13737773210761477440 | 8865856088220996160 | 4238125881248233392 | 1457426502522699552 | 341203813611380460 | 48715279773747300 | 3201870700153125 | 73868751753698441925 |
Compute more
?
Technical details
- Node id
n-b2364ce52abc9924· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-df56de28b5551755
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 0)
- 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: 2, 2; 2: 8, 20, 9; 3: 48, 200, 204, 60; 4: 384, 2272, 3732, 2384, 525; 5: 3840, 29632, 67992, 68624, 32070, 5670; 6: 46080, 440064, 1304832, 1820704, 1328420, 491364, 72765; 7: 645120, 7358976, 26848896, 48106944, 48184320, 27602448, 8471064, 1081080; 8: 10321920, 137097216, 595159296, 1306689024, 1672954320, 1308956928, 618579864, 162515520, 18243225; 9: 185794560, 2818695168, 14208846336, 37010679808, 57880319520, 57689492832, 37095416624, 14943402432, 3436487370, 344594250;
%F FormulaThe row polynomials satisfy (2*n-3)*P(n,x) = -(8*n^3-20*n^2+16*n-4+(16*n^3-48*n^2+44*n-12)*x+(8*n^3-28*n^2+30*n-9)*x^2)*P(n-2,x) + (8*n^2-12*n+2+(8*n^2-16*n+6)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(8*n^3 - 20*n^2 + 16*n - 4 + (16*n^3 - 48*n^2 + 44*n - 12)*x + (8*n^3 - 28*n^2 + 30*n - 9)*x^2)*P[n - 2, x] + (8*n^2 - 12*n + 2 + (8*n^2 - 16*n + 6)*x)*P[n - 1, x])/(2*n - 3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(8*n^3 - 20*n^2 + 16*n - 4 + (16*n^3 - 48*n^2 + 44*n - 12)*x + (8*n^3 - 28*n^2 + 30*n - 9)*x^2)*v[i - 2] + (8*n^2 - 12*n + 2 + (8*n^2 - 16*n + 6)*x)*v[i - 1])/(2*n - 3)); 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 ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [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.