A132812 → basis A007318 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(4\,n + 2\,n^{2} + 2\,n^{2} x + n^{3} x\right)\,P_{n}(x) = \left(4 + 12\,n + 14\,n x + 2\,n x^{2} + 8\,n^{2} + 18\,n^{2} x + 7\,n^{2} x^{2} + 4\,n^{3} x + 3\,n^{3} x^{2}\right)\,P_{n-1}(x) + \left(-4\,x - 6\,x^{2} - 2\,x^{3} - 4\,n x - 9\,n x^{2} - 5\,n x^{3} - 2\,n^{2} x^{2} - 2\,n^{2} x^{3}\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 | 4 | 4 | 8 | |||||||||||||
| 2 | 15 | 30 | 9 | 54 | ||||||||||||
| 3 | 56 | 168 | 108 | 16 | 348 | |||||||||||
| 4 | 210 | 840 | 840 | 280 | 25 | 2195 | ||||||||||
| 5 | 792 | 3960 | 5400 | 2880 | 600 | 36 | 13668 | |||||||||
| 6 | 3003 | 18018 | 31185 | 23100 | 7875 | 1134 | 49 | 84364 | ||||||||
| 7 | 11440 | 80080 | 168168 | 160160 | 77000 | 18480 | 1960 | 64 | 517352 | |||||||
| 8 | 43758 | 350064 | 864864 | 1009008 | 630630 | 216216 | 38808 | 3168 | 81 | 3156597 | ||||||
| 9 | 167960 | 1511640 | 4296240 | 5940480 | 4586400 | 2063880 | 535080 | 74880 | 4860 | 100 | 19181520 | |||||
| 10 | 646646 | 6466460 | 20785050 | 33256080 | 30630600 | 17153136 | 5885880 | 1201200 | 135135 | 7150 | 121 | 116167458 | ||||
| 11 | 2496144 | 27457584 | 98489160 | 179071200 | 191862000 | 128931264 | 55417824 | 15079680 | 2494800 | 231000 | 10164 | 144 | 701540964 | |||
| 12 | 9657700 | 115892400 | 458933904 | 934865360 | 1143177750 | 897914160 | 465585120 | 159629184 | 35443980 | 4862000 | 377520 | 14040 | 169 | 4226353287 | ||
| 13 | 37442160 | 486748080 | 2109241680 | 4759314560 | 6544057520 | 5889651768 | 3585005424 | 1489872384 | 419026608 | 77597520 | 8984976 | 594048 | 18928 | 196 | 25407555852 | |
| 14 | 145422675 | 2035917450 | 9582852825 | 23728968900 | 36252591375 | 36810323550 | 25767226485 | 12620682360 | 4321211895 | 1018467450 | 160044885 | 15872220 | 904995 | 24990 | 225 | 152460512280 |
Compute more
?
Technical details
- Node id
n-294d7f22508b5365· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-1dcc13434ed0f3e9
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: 4, 4; 2: 15, 30, 9; 3: 56, 168, 108, 16; 4: 210, 840, 840, 280, 25; 5: 792, 3960, 5400, 2880, 600, 36; 6: 3003, 18018, 31185, 23100, 7875, 1134, 49; 7: 11440, 80080, 168168, 160160, 77000, 18480, 1960, 64; 8: 43758, 350064, 864864, 1009008, 630630, 216216, 38808, 3168, 81; 9: 167960, 1511640, 4296240, 5940480, 4586400, 2063880, 535080, 74880, 4860, 100;
%F FormulaThe row polynomials satisfy (2*n^2+4*n+(n^3+2*n^2)*x)*P(n,x) = (8*n^2+12*n+4+(4*n^3+18*n^2+14*n)*x+(3*n^3+7*n^2+2*n)*x^2)*P(n-1,x) - ((4*n+4)*x+(2*n^2+9*n+6)*x^2+(2*n^2+5*n+2)*x^3)*d/dx 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[((8*n^2 + 12*n + 4 + (4*n^3 + 18*n^2 + 14*n)*x + (3*n^3 + 7*n^2 + 2*n)*x^2)*P[n - 1, x] - ((4*n + 4)*x + (2*n^2 + 9*n + 6)*x^2 + (2*n^2 + 5*n + 2)*x^3)*D[P[n - 1, x], x])/(2*n^2 + 4*n + (n^3 + 2*n^2)*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] = ((8*n^2 + 12*n + 4 + (4*n^3 + 18*n^2 + 14*n)*x + (3*n^3 + 7*n^2 + 2*n)*x^2)*v[i - 1] - ((4*n + 4)*x + (2*n^2 + 9*n + 6)*x^2 + (2*n^2 + 5*n + 2)*x^3)*deriv(v[i - 1], x))/(2*n^2 + 4*n + (n^3 + 2*n^2)*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
shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
narayana?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
narayana?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
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, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
-
from
basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
-
from
shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
Related ?
Same fingerprint ?
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