A126216 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-24 - 54\,x + 54\,x^{2} + 6\,n + 81\,n x + 27\,n x^{2} + 63\,n^{2} + 54\,n^{2} x + 27\,n^{3}\right)\,P_{n}(x) = \left(-24 - 54\,x + 54\,x^{2} - 12\,n - 108\,n x + 189\,n x^{2} + 243\,n x^{3} + 279\,n^{2} + 621\,n^{2} x + 486\,n^{2} x^{2} + 189\,n^{3} + 243\,n^{3} x\right)\,P_{n-1}(x) + \left(-20 - 126\,x - 288\,x^{2} - 324\,x^{3} - 162\,x^{4} - 66\,n - 369\,n x - 621\,n x^{2} - 324\,n x^{3} - 36\,n^{2} - 162\,n^{2} x - 162\,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 | 6 | 3 | 9 | |||||||||||||
| 2 | 32 | 39 | 9 | 80 | ||||||||||||
| 3 | 171 | 342 | 189 | 27 | 729 | |||||||||||
| 4 | 923 | 2598 | 2394 | 810 | 81 | 6806 | ||||||||||
| 5 | 5028 | 18345 | 24120 | 13770 | 3240 | 243 | 64746 | |||||||||
| 6 | 27598 | 124029 | 213570 | 175905 | 70470 | 12393 | 729 | 624694 | ||||||||
| 7 | 152421 | 815052 | 1742202 | 1895670 | 1105650 | 333396 | 45927 | 2187 | 6092505 | |||||||
| 8 | 846101 | 5250828 | 13435128 | 18269496 | 14181804 | 6273288 | 1490076 | 166212 | 6561 | 59919494 | ||||||
| 9 | 4716738 | 33339087 | 99470916 | 162774360 | 158846184 | 94119732 | 33006204 | 6377292 | 590490 | 19683 | 593260686 | |||||
| 10 | 26388588 | 209351475 | 714158235 | 1368560610 | 1614793320 | 1209145644 | 571178790 | 163828170 | 26375220 | 2066715 | 59049 | 5905905816 | ||||
| 11 | 148087503 | 1303276194 | 5005868175 | 11006269065 | 15266759310 | 13881017304 | 8325309762 | 3232539090 | 776199105 | 106091370 | 7144929 | 177147 | 59058738954 | |||
| 12 | 833233551 | 8057117682 | 34421844402 | 85463356770 | 136446292125 | 146357110548 | 106999473636 | 52970338476 | 17293975875 | 3539987550 | 417004038 | 24446286 | 531441 | 592824712380 | ||
| 13 | 4699089216 | 49528455093 | 233014911948 | 645067254546 | 1166091513444 | 1443879432567 | 1249312727520 | 756549251172 | 316121104728 | 88327127889 | 15638300964 | 1607431878 | 82904796 | 1594323 | 5969921100084 | |
| 14 | 26554499418 | 303023979657 | 1556954973756 | 4756431300075 | 9608832607374 | 13504818035709 | 13525344582750 | 9722312381925 | 4985369879490 | 1788905102985 | 433853079660 | 67238092467 | 6093502506 | 279006525 | 4782969 | 60286015807266 |
Compute more
?
Technical details
- Node id
n-2ce5f5474899f519· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-bc83e7685d3c0684
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: 6, 3; 2: 32, 39, 9; 3: 171, 342, 189, 27; 4: 923, 2598, 2394, 810, 81; 5: 5028, 18345, 24120, 13770, 3240, 243; 6: 27598, 124029, 213570, 175905, 70470, 12393, 729; 7: 152421, 815052, 1742202, 1895670, 1105650, 333396, 45927, 2187; 8: 846101, 5250828, 13435128, 18269496, 14181804, 6273288, 1490076, 166212, 6561; 9: 4716738, 33339087, 99470916, 162774360, 158846184, 94119732, 33006204, 6377292, 590490, 19683;
%F FormulaThe row polynomials satisfy (27*n^3+63*n^2+6*n-24+(54*n^2+81*n-54)*x+(27*n+54)*x^2)*P(n,x) = (189*n^3+279*n^2-12*n-24+(243*n^3+621*n^2-108*n-54)*x+(486*n^2+189*n+54)*x^2+243*n*x^3)*P(n-1,x) - (36*n^2+66*n+20+(162*n^2+369*n+126)*x+(162*n^2+621*n+288)*x^2+(324*n+324)*x^3+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[((189*n^3 + 279*n^2 - 12*n - 24 + (243*n^3 + 621*n^2 - 108*n - 54)*x + (486*n^2 + 189*n + 54)*x^2 + 243*n*x^3)*P[n - 1, x] - (36*n^2 + 66*n + 20 + (162*n^2 + 369*n + 126)*x + (162*n^2 + 621*n + 288)*x^2 + (324*n + 324)*x^3 + 162*x^4)*D[P[n - 1, x], x])/(27*n^3 + 63*n^2 + 6*n - 24 + (54*n^2 + 81*n - 54)*x + (27*n + 54)*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] = ((189*n^3 + 279*n^2 - 12*n - 24 + (243*n^3 + 621*n^2 - 108*n - 54)*x + (486*n^2 + 189*n + 54)*x^2 + 243*n*x^3)*v[i - 1] - (36*n^2 + 66*n + 20 + (162*n^2 + 369*n + 126)*x + (162*n^2 + 621*n + 288)*x^2 + (324*n + 324)*x^3 + 162*x^4)*deriv(v[i - 1], x))/(27*n^3 + 63*n^2 + 6*n - 24 + (54*n^2 + 81*n - 54)*x + (27*n + 54)*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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] 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