A136572 → basis A013610 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - 3\,x + 9\,n x + 9\,n^{2} x^{2}\right)\,P_{n}(x) = \left(n + 9\,n x + 27\,n x^{2} + 27\,n x^{3} + 9\,n^{2} x + 45\,n^{2} x^{2} + 54\,n^{2} x^{3} + 9\,n^{3} x^{2} + 27\,n^{3} x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 12 | 13 | ||||||
| 2 | 2 | 48 | 162 | 212 | |||||
| 3 | 6 | 216 | 1458 | 2592 | 4272 | ||||
| 4 | 24 | 1152 | 11664 | 41472 | 48600 | 102912 | |||
| 5 | 120 | 7200 | 97200 | 518400 | 1215000 | 1049760 | 2887680 | ||
| 6 | 720 | 51840 | 874800 | 6220800 | 21870000 | 37791360 | 25719120 | 92528640 | |
| 7 | 5040 | 423360 | 8573040 | 76204800 | 357210000 | 925888320 | 1260236880 | 705438720 | 3333980160 |
Compute more
?
Technical details
- Node id
n-b8fc3e74039cf5b1· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-10c18c8945c6e24a
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: 1, 12; 2: 2, 48, 162; 3: 6, 216, 1458, 2592; 4: 24, 1152, 11664, 41472, 48600; 5: 120, 7200, 97200, 518400, 1215000, 1049760; 6: 720, 51840, 874800, 6220800, 21870000, 37791360, 25719120; 7: 5040, 423360, 8573040, 76204800, 357210000, 925888320, 1260236880, 705438720; 8: 40320, 3870720, 91445760, 975421440, 5715360000, 19752284160, 40327580160, 45148078080, 21427701120; 9: 362880, 39191040, 1058158080, 13168189440, 92588832000, 399983754240, 1088844664320, 1828497162240, 1735643790720, 714256704000;
%F FormulaThe row polynomials satisfy (1+(9*n-3)*x+9*n^2*x^2)*P(n,x) = (n+(9*n^2+9*n)*x+(9*n^3+45*n^2+27*n)*x^2+(27*n^3+54*n^2+27*n)*x^3)*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 + (9*n^2 + 9*n)*x + (9*n^3 + 45*n^2 + 27*n)*x^2 + (27*n^3 + 54*n^2 + 27*n)*x^3)*P[n - 1, x])/(1 + (9*n - 3)*x + 9*n^2*x^2)]];
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 + (9*n^2 + 9*n)*x + (9*n^3 + 45*n^2 + 27*n)*x^2 + (27*n^3 + 54*n^2 + 27*n)*x^3)*v[i - 1])/(1 + (9*n - 3)*x + 9*n^2*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 ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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 ›
-
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_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!.?
Related ?
Same fingerprint ?
- basis-map coefficients of A026729 → basis A013610 → (θ+1)²
- A013610 → basis A013611 → (θ+1)²
- basis-map coefficients of A030528, shifted → basis A013610 → (θ+1)²
- basis-map coefficients of A112227 → basis A013610 → (θ+1)²
- basis-map coefficients of A026729, shifted → basis A013610 → (θ+1)²
- A130123 → basis A013610 → (θ+1)²
- A013610 → D → (θ+1)²
- A013610 → (θ+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.