A063007 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2 + 3\,x - 4\,x^{2} - 2\,n - 3\,n x + 10\,n x^{2} - 8\,n^{2} x^{2} + 2\,n^{3} x^{2}\right)\,P_{n}(x) = \left(6 + 17\,x + 12\,x^{2} - 6\,n - 13\,n x + 6\,n x^{2} + 16\,n x^{3} - 4\,n^{2} x - 24\,n^{2} x^{2} - 24\,n^{2} x^{3} + 6\,n^{3} x^{2} + 8\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-2 - 12\,x - 22\,x^{2} - 12\,x^{3} - 8\,n x^{2} - 24\,n x^{3} - 16\,n x^{4} + 4\,n^{2} x^{2} + 12\,n^{2} x^{3} + 8\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 3 | 8 | 11 | |||||||||||||
| 3 | 13 | 72 | 72 | 157 | ||||||||||||
| 4 | 63 | 528 | 1080 | 640 | 2311 | |||||||||||
| 5 | 321 | 3600 | 11160 | 13440 | 5600 | 34121 | ||||||||||
| 6 | 1683 | 23640 | 98280 | 179200 | 151200 | 48384 | 502387 | |||||||||
| 7 | 8989 | 151704 | 791280 | 1935360 | 2469600 | 1596672 | 413952 | 7367557 | ||||||||
| 8 | 48639 | 958496 | 6014736 | 18466560 | 31600800 | 30868992 | 16144128 | 3514368 | 107616719 | |||||||
| 9 | 265729 | 5988384 | 43923600 | 162328320 | 348717600 | 456648192 | 360552192 | 158146560 | 29652480 | 1566223057 | ||||||
| 10 | 1462563 | 37097640 | 311422320 | 1345935360 | 3481077600 | 5721940224 | 6054048000 | 4006379520 | 1512276480 | 248934400 | 22720574107 | |||||
| 11 | 8097453 | 228297960 | 2158489080 | 10681482240 | 32314682400 | 63951503616 | 84918113280 | 75277762560 | 42847833600 | 14189260800 | 2081091584 | 328656614573 | ||||
| 12 | 45046719 | 1397469744 | 14694193800 | 81929527680 | 283869986400 | 657185937408 | 1050595273728 | 1168597647360 | 890730846720 | 444596838400 | 131108769792 | 17336696832 | 4742088234583 | |||
| 13 | 251595969 | 8516894256 | 98583901416 | 611510739840 | 2387788603200 | 6331800803328 | 11841244326912 | 15855647588352 | 15161579896320 | 10131132211200 | 4501401096192 | 1196232081408 | 143990898688 | 68269680637081 | ||
| 14 | 1409933619 | 51716663544 | 653461263000 | 4463436257280 | 19393580606400 | 57964112414208 | 124168944227328 | 194495035637760 | 223860775057920 | 187624595558400 | 111573563092992 | 44659331039232 | 10799317401600 | 1192824012800 | 980902103166083 | |
| 15 | 7923848253 | 313062555960 | 4287633648480 | 31977651363840 | 153028762286400 | 509013410121216 | 1229087605025280 | 2205283562127360 | 2969054933644800 | 2994941466316800 | 2233481596329984 | 1196232081408000 | 435572468531200 | 96618745036800 | 9859055616000 | 14068759957860373 |
Compute more
?
Technical details
- Node id
n-774b8b68c437bf61· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-90dff7c8d5583170
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 3, 8; 3: 13, 72, 72; 4: 63, 528, 1080, 640; 5: 321, 3600, 11160, 13440, 5600; 6: 1683, 23640, 98280, 179200, 151200, 48384; 7: 8989, 151704, 791280, 1935360, 2469600, 1596672, 413952; 8: 48639, 958496, 6014736, 18466560, 31600800, 30868992, 16144128, 3514368; 9: 265729, 5988384, 43923600, 162328320, 348717600, 456648192, 360552192, 158146560, 29652480; 10: 1462563, 37097640, 311422320, 1345935360, 3481077600, 5721940224, 6054048000, 4006379520, 1512276480, 248934400;
%F FormulaThe row polynomials satisfy -(2*n-2+(3*n-3)*x-(2*n^3-8*n^2+10*n-4)*x^2)*P(n,x) = -(6*n-6+(4*n^2+13*n-17)*x-(6*n^3-24*n^2+6*n+12)*x^2-(8*n^3-24*n^2+16*n)*x^3)*P(n-1,x) - (2+12*x-(4*n^2-8*n-22)*x^2-(12*n^2-24*n-12)*x^3-(8*n^2-16*n)*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(6*n - 6 + (4*n^2 + 13*n - 17)*x - (6*n^3 - 24*n^2 + 6*n + 12)*x^2 - (8*n^3 - 24*n^2 + 16*n)*x^3)*P[n - 1, x] - (2 + 12*x - (4*n^2 - 8*n - 22)*x^2 - (12*n^2 - 24*n - 12)*x^3 - (8*n^2 - 16*n)*x^4)*D[P[n - 1, x], x])/(-2*n + 2 - (3*n - 3)*x + (2*n^3 - 8*n^2 + 10*n - 4)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(6*n - 6 + (4*n^2 + 13*n - 17)*x - (6*n^3 - 24*n^2 + 6*n + 12)*x^2 - (8*n^3 - 24*n^2 + 16*n)*x^3)*v[i - 1] - (2 + 12*x - (4*n^2 - 8*n - 22)*x^2 - (12*n^2 - 24*n - 12)*x^3 - (8*n^2 - 16*n)*x^4)*deriv(v[i - 1], x))/(-2*n + 2 - (3*n - 3)*x + (2*n^3 - 8*n^2 + 10*n - 4)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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 ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
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 ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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 ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
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: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
-
from
basis_map_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
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