A126216 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(24 + 72\,x + 12\,n + 108\,n x + 54\,n x^{2} + 36\,n^{2} x + 81\,n^{2} x^{2} + 27\,n^{3} x^{2}\right)\,P_{n}(x) = \left(24 + 72\,x + 84\,n + 504\,n x + 702\,n x^{2} + 162\,n x^{3} + 288\,n^{2} x + 891\,n^{2} x^{2} + 567\,n^{2} x^{3} + 189\,n^{3} x^{2} + 243\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-8 - 84\,x - 288\,x^{2} - 378\,x^{3} - 162\,x^{4} - 48\,n x - 306\,n x^{2} - 621\,n x^{3} - 405\,n x^{4} - 36\,n^{2} x^{2} - 162\,n^{2} x^{3} - 162\,n^{2} x^{4}\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 | 3 | 6 | 9 | |||||||||||||
| 2 | 11 | 42 | 27 | 80 | ||||||||||||
| 3 | 45 | 252 | 324 | 108 | 729 | |||||||||||
| 4 | 197 | 1452 | 2808 | 1944 | 405 | 6806 | ||||||||||
| 5 | 903 | 8250 | 21330 | 22680 | 10125 | 1458 | 64746 | |||||||||
| 6 | 4279 | 46638 | 151065 | 217620 | 151875 | 48114 | 5103 | 624694 | ||||||||
| 7 | 20793 | 263256 | 1025136 | 1867320 | 1786050 | 898128 | 214326 | 17496 | 6092505 | |||||||
| 8 | 103049 | 1486104 | 6761664 | 14908320 | 18178020 | 12655440 | 4858056 | 909792 | 59049 | 59919494 | ||||||
| 9 | 518859 | 8395758 | 43711812 | 113200416 | 168092820 | 150273144 | 80586576 | 24564384 | 3720087 | 196830 | 593260686 | |||||
| 10 | 2646723 | 47483730 | 278414415 | 828471240 | 1451803500 | 1589319144 | 1101635640 | 472916880 | 117802755 | 14762250 | 649539 | 5905905816 | ||||
| 11 | 13648869 | 268877268 | 1753256340 | 5895265860 | 11915565750 | 15460375392 | 13188336084 | 7361442000 | 2601403695 | 541282500 | 57159432 | 2125764 | 59058738954 | |||
| 12 | 71039373 | 1524388356 | 10942385256 | 41032510200 | 94006536525 | 141173981784 | 143299465848 | 98889281568 | 45685325565 | 13575365100 | 2400696144 | 216827928 | 6908733 | 592824712380 | ||
| 13 | 372693519 | 8652791394 | 67803089094 | 280551843000 | 718661617245 | 1226831027994 | 1445975526996 | 1191708337248 | 683533922643 | 266858767890 | 67805376210 | 10335464568 | 808321761 | 22320522 | 5969921100084 | |
| 14 | 1968801519 | 49171395798 | 417657422637 | 1890314443836 | 5354815861395 | 10245443322114 | 13763451506805 | 13210442542440 | 9079882947135 | 4418326662750 | 1481779680381 | 326340911988 | 43379934507 | 2968629426 | 71744535 | 60286015807266 |
Compute more
?
Technical details
- Node id
n-8b0f4c9b4460ebb0· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-31e7b5ad0ec8251b
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: 3, 6; 2: 11, 42, 27; 3: 45, 252, 324, 108; 4: 197, 1452, 2808, 1944, 405; 5: 903, 8250, 21330, 22680, 10125, 1458; 6: 4279, 46638, 151065, 217620, 151875, 48114, 5103; 7: 20793, 263256, 1025136, 1867320, 1786050, 898128, 214326, 17496; 8: 103049, 1486104, 6761664, 14908320, 18178020, 12655440, 4858056, 909792, 59049; 9: 518859, 8395758, 43711812, 113200416, 168092820, 150273144, 80586576, 24564384, 3720087, 196830;
%F FormulaThe row polynomials satisfy (12*n+24+(36*n^2+108*n+72)*x+(27*n^3+81*n^2+54*n)*x^2)*P(n,x) = (84*n+24+(288*n^2+504*n+72)*x+(189*n^3+891*n^2+702*n)*x^2+(243*n^3+567*n^2+162*n)*x^3)*P(n-1,x) - (8+(48*n+84)*x+(36*n^2+306*n+288)*x^2+(162*n^2+621*n+378)*x^3+(162*n^2+405*n+162)*x^4)*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[((84*n + 24 + (288*n^2 + 504*n + 72)*x + (189*n^3 + 891*n^2 + 702*n)*x^2 + (243*n^3 + 567*n^2 + 162*n)*x^3)*P[n - 1, x] - (8 + (48*n + 84)*x + (36*n^2 + 306*n + 288)*x^2 + (162*n^2 + 621*n + 378)*x^3 + (162*n^2 + 405*n + 162)*x^4)*D[P[n - 1, x], x])/(12*n + 24 + (36*n^2 + 108*n + 72)*x + (27*n^3 + 81*n^2 + 54*n)*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] = ((84*n + 24 + (288*n^2 + 504*n + 72)*x + (189*n^3 + 891*n^2 + 702*n)*x^2 + (243*n^3 + 567*n^2 + 162*n)*x^3)*v[i - 1] - (8 + (48*n + 84)*x + (36*n^2 + 306*n + 288)*x^2 + (162*n^2 + 621*n + 378)*x^3 + (162*n^2 + 405*n + 162)*x^4)*deriv(v[i - 1], x))/(12*n + 24 + (36*n^2 + 108*n + 72)*x + (27*n^3 + 81*n^2 + 54*n)*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
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: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
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 of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
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
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
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) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
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