A196347 → x ↦ x+1 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2 + n x\right)\,P_{n}(x) = \left(4\,n + 4\,n x + n x^{2} + 2\,n^{2} x + 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 | 2 | 2 | 4 | |||||||||||||
| 2 | 8 | 16 | 6 | 30 | ||||||||||||
| 3 | 48 | 144 | 108 | 24 | 324 | |||||||||||
| 4 | 384 | 1536 | 1728 | 768 | 120 | 4536 | ||||||||||
| 5 | 3840 | 19200 | 28800 | 19200 | 6000 | 720 | 77760 | |||||||||
| 6 | 46080 | 276480 | 518400 | 460800 | 216000 | 51840 | 5040 | 1574640 | ||||||||
| 7 | 645120 | 4515840 | 10160640 | 11289600 | 7056000 | 2540160 | 493920 | 40320 | 36741600 | |||||||
| 8 | 10321920 | 82575360 | 216760320 | 289013760 | 225792000 | 108380160 | 31610880 | 5160960 | 362880 | 969978240 | ||||||
| 9 | 185794560 | 1672151040 | 5016453120 | 7803371520 | 7315660800 | 4389396480 | 1706987520 | 418037760 | 58786560 | 3628800 | 28570268160 | |||||
| 10 | 3715891200 | 37158912000 | 125411328000 | 222953472000 | 243855360000 | 175575859200 | 85349376000 | 27869184000 | 5878656000 | 725760000 | 39916800 | 928533715200 | ||||
| 11 | 81749606400 | 899245670400 | 3372171264000 | 6744342528000 | 8430428160000 | 7081559654400 | 4130909798400 | 1686085632000 | 474211584000 | 87816960000 | 9659865600 | 479001600 | 32998659724800 | |||
| 12 | 1961990553600 | 23543886643200 | 97118532403200 | 215818960896000 | 303495413760000 | 291355597209600 | 198283670323200 | 97118532403200 | 34143234048000 | 8430428160000 | 1391020646400 | 137952460800 | 6227020800 | 1272805446528000 | ||
| 13 | 51011754393600 | 663152807116800 | 2984187632025600 | 7294680878284800 | 11397938872320000 | 12309773982105600 | 9574268652748800 | 5471010658713600 | 2308082621644800 | 712371179520000 | 156721659494400 | 23313965875200 | 2104733030400 | 87178291200 | 52948706575564800 | |
| 14 | 1428329123020800 | 19996607722291200 | 97483462646169600 | 259955900389785600 | 446799203794944000 | 536159044553932800 | 469139163984691200 | 306376596887961600 | 150794731280793600 | 55849900474368000 | 15358722630451200 | 3046358207692800 | 412527673958400 | 34173890150400 | 1307674368000 | 2362836030934579200 |
Compute more
?
Technical details
- Node id
n-4f58ee6499244b82· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-e620d4a356abb37c
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: 2, 2; 2: 8, 16, 6; 3: 48, 144, 108, 24; 4: 384, 1536, 1728, 768, 120; 5: 3840, 19200, 28800, 19200, 6000, 720; 6: 46080, 276480, 518400, 460800, 216000, 51840, 5040; 7: 645120, 4515840, 10160640, 11289600, 7056000, 2540160, 493920, 40320; 8: 10321920, 82575360, 216760320, 289013760, 225792000, 108380160, 31610880, 5160960, 362880; 9: 185794560, 1672151040, 5016453120, 7803371520, 7315660800, 4389396480, 1706987520, 418037760, 58786560, 3628800;
%F FormulaThe row polynomials satisfy (2+n*x)*P(n,x) = (4*n+(2*n^2+4*n)*x+(n^2+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[((4*n + (2*n^2 + 4*n)*x + (n^2 + n)*x^2)*P[n - 1, x])/(2 + 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] = ((4*n + (2*n^2 + 4*n)*x + (n^2 + n)*x^2)*v[i - 1])/(2 + 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_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 ›
-
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!.?
-
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) 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) (above)
- ↑ Geometric basis map (elementary) (above)
-
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) 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) (above)
-
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
Related ?
Same fingerprint ?
- basis-map coefficients of A113214, shifted → x ↦ x+1 → θ+1
- A085880 → x ↦ x+1 → θ+1
- A038325 → basis A007318 → θ+1
- image under θ+1 → θ+1 → D+1 → basis A013609
- A003506 → x ↦ x+1 → θ+1
- A156992 → basis A007318 → θ+1
- A038221 → x ↦ x+1 → θ+1
- A038338 → x ↦ x+1 → θ+1
- A135065 → x ↦ x+1 → θ+1
- A038330 → basis A013609 → θ+1
- A178820 → basis A007318 → θ+1
- A132440 → D+1 → basis A013609
- A085881 → basis A007318 → θ+1
- A356546 → x ↦ x+1 → θ+1
- A038208 → basis A007318 → θ+1
- A120910 → D → θ+1
- A027466 → basis A013611 → θ+1
- A120910 → θ+1
- A131431 → D+1 → basis A013609
- A094305 → x ↦ x+1 → θ+1
- A178821 → basis A007318 → θ+1
- A038207 → θ+1
- A178822 → x ↦ x+1 → θ+1
- A028326 → basis A007318 → θ+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.