A136572 → basis A013611 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 + 4\,n x\right)\,P_{n}(x) = \left(n + 8\,n x + 16\,n x^{2} + 4\,n^{2} x + 16\,n^{2} x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 8 | 9 | |||||||||||||
| 2 | 2 | 32 | 96 | 130 | ||||||||||||
| 3 | 6 | 144 | 864 | 1536 | 2550 | |||||||||||
| 4 | 24 | 768 | 6912 | 24576 | 30720 | 63000 | ||||||||||
| 5 | 120 | 4800 | 57600 | 307200 | 768000 | 737280 | 1875000 | |||||||||
| 6 | 720 | 34560 | 518400 | 3686400 | 13824000 | 26542080 | 20643840 | 65250000 | ||||||||
| 7 | 5040 | 282240 | 5080320 | 45158400 | 225792000 | 650280960 | 1011548160 | 660602880 | 2598750000 | |||||||
| 8 | 40320 | 2580480 | 54190080 | 578027520 | 3612672000 | 13872660480 | 32369541120 | 42278584320 | 23781703680 | 116550000000 | ||||||
| 9 | 362880 | 26127360 | 627056640 | 7803371520 | 58525286400 | 280921374720 | 873977610240 | 1712282664960 | 1926317998080 | 951268147200 | 5811750000000 | |||||
| 10 | 3628800 | 290304000 | 7838208000 | 111476736000 | 975421440000 | 5618427494400 | 21849440256000 | 57076088832000 | 96315899904000 | 95126814720000 | 41855798476800 | 318937500000000 | ||||
| 11 | 39916800 | 3512678400 | 105380352000 | 1686085632000 | 16860856320000 | 113304954470400 | 528756454195200 | 1726551687168000 | 3884741296128000 | 5755172290560000 | 5064551615692800 | 2009078326886400 | 19100812500000000 | |||
| 12 | 479001600 | 45984153600 | 1517477068800 | 26977370112000 | 303495413760000 | 2330844777676800 | 12690154900684800 | 49724688590438400 | 139850686660608000 | 276248269946880000 | 364647716329881600 | 289307279071641600 | 104472072998092800 | 1239603750000000000 | ||
| 13 | 6227020800 | 647610163200 | 23313965875200 | 455917554892800 | 5698969436160000 | 49239095928422400 | 306376596887961600 | 1400578728630681600 | 4726953209128550400 | 11671489405255680000 | 20541821353249996800 | 24446465081553715200 | 17655780336677683200 | 5850436087893196800 | 86655318750000000000 | |
| 14 | 87178291200 | 9763968614400 | 380794775961600 | 8123621887180800 | 111699800948736000 | 1072318089107865600 | 7506226623755059200 | 39216204401659084800 | 154413804831532646400 | 457522384686022656000 | 1006549246309249843200 | 1597169051994842726400 | 1730266472994412953600 | 1146685473227066572800 | 351026165273591808000 | 6491547562500000000000 |
Compute more
?
Technical details
- Node id
n-746c648eef173fb9· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-14ef8ed0e797c5a3
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 1, 8; 2: 2, 32, 96; 3: 6, 144, 864, 1536; 4: 24, 768, 6912, 24576, 30720; 5: 120, 4800, 57600, 307200, 768000, 737280; 6: 720, 34560, 518400, 3686400, 13824000, 26542080, 20643840; 7: 5040, 282240, 5080320, 45158400, 225792000, 650280960, 1011548160, 660602880; 8: 40320, 2580480, 54190080, 578027520, 3612672000, 13872660480, 32369541120, 42278584320, 23781703680; 9: 362880, 26127360, 627056640, 7803371520, 58525286400, 280921374720, 873977610240, 1712282664960, 1926317998080, 951268147200;
%F FormulaThe row polynomials satisfy (1+4*n*x)*P(n,x) = (n+(4*n^2+8*n)*x+(16*n^2+16*n)*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n + (4*n^2 + 8*n)*x + (16*n^2 + 16*n)*x^2)*P[n - 1, x])/(1 + 4*n*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n + (4*n^2 + 8*n)*x + (16*n^2 + 16*n)*x^2)*v[i - 1])/(1 + 4*n*x)); 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_A013611 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
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
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
- ↑ Geometric basis map (elementary) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
-
from
basis_map_A013610 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
-
from
basis_map_A013611 of Triangle read by rows: row n consists of n zeros followed by n!.?
Related ?
Same fingerprint ?
- A130123 → basis A013611 → θ+1
- A013611 → θ+1
- basis-map coefficients of A026729 → basis A013611 → θ+1
- A013611 → D → θ+1
- basis-map coefficients of A112227 → basis A013611 → θ+1
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.