A063007 → x ↦ x+1 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-16 - 18\,x + 39\,x^{2} + 27\,x^{3} - 4\,x^{4} + 16\,n + 18\,n x - 99\,n x^{2} - 63\,n x^{3} + 16\,n x^{4} + 80\,n^{2} x^{2} + 48\,n^{2} x^{3} - 25\,n^{2} x^{4} - 20\,n^{3} x^{2} - 12\,n^{3} x^{3} + 19\,n^{3} x^{4} - 7\,n^{4} x^{4} + n^{5} x^{4}\right)\,P_{n}(x) = \left(-48 - 70\,x - 3\,x^{2} + 33\,x^{3} + 12\,x^{4} + 48\,n + 14\,n x - 189\,n x^{2} - 209\,n x^{3} - 60\,n x^{4} + 56\,n^{2} x + 252\,n^{2} x^{2} + 240\,n^{2} x^{3} + 51\,n^{2} x^{4} - 8\,n^{2} x^{5} - 60\,n^{3} x^{2} - 56\,n^{3} x^{3} + 15\,n^{3} x^{4} + 16\,n^{3} x^{5} - 8\,n^{4} x^{3} - 21\,n^{4} x^{4} - 10\,n^{4} x^{5} + 3\,n^{5} x^{4} + 2\,n^{5} x^{5}\right)\,P_{n-1}(x) + \left(16 + 72\,x + 76\,x^{2} - 6\,x^{3} - 38\,x^{4} - 12\,x^{5} + 112\,n x^{2} + 264\,n x^{3} + 200\,n x^{4} + 48\,n x^{5} - 56\,n^{2} x^{2} - 132\,n^{2} x^{3} - 84\,n^{2} x^{4} + 8\,n^{2} x^{6} - 16\,n^{3} x^{4} - 24\,n^{3} x^{5} - 8\,n^{3} x^{6} + 4\,n^{4} x^{4} + 6\,n^{4} x^{5} + 2\,n^{4} x^{6}\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 | 54 | 139 | ||||||||||||
| 4 | 63 | 528 | 810 | 320 | 1721 | |||||||||||
| 5 | 321 | 3600 | 8370 | 6720 | 1750 | 20761 | ||||||||||
| 6 | 1683 | 23640 | 73710 | 89600 | 47250 | 9072 | 244955 | |||||||||
| 7 | 8989 | 151704 | 593460 | 967680 | 771750 | 299376 | 45276 | 2838235 | ||||||||
| 8 | 48639 | 958496 | 4511052 | 9233280 | 9875250 | 5787936 | 1765764 | 219648 | 32400065 | |||||||
| 9 | 265729 | 5988384 | 32942700 | 81164160 | 108974250 | 85621536 | 39435396 | 9884160 | 1042470 | 365318785 | ||||||
| 10 | 1462563 | 37097640 | 233566740 | 672967680 | 1087836750 | 1072863792 | 662161500 | 250398720 | 53165970 | 4862000 | 4076383355 | |||||
| 11 | 8097453 | 228297960 | 1618866810 | 5340741120 | 10098338250 | 11990906928 | 9287918640 | 4704860160 | 1506369150 | 277134000 | 22355476 | 45083885947 | ||||
| 12 | 45046719 | 1397469744 | 11020645350 | 40964763840 | 88709370750 | 123222363264 | 114908858064 | 73037352960 | 31314756330 | 8683532000 | 1408394988 | 101582208 | 494814136217 | |||
| 13 | 251595969 | 8516894256 | 73937926062 | 305755369920 | 746183938500 | 1187212650624 | 1295136098256 | 990977974272 | 533024293230 | 197873676000 | 48354894588 | 7009172352 | 457002364 | 5394691486393 | ||
| 14 | 1409933619 | 51716663544 | 490095947250 | 2231718128640 | 6060493939500 | 10868271077664 | 13580978274864 | 12155939727360 | 7870105373130 | 3664542882000 | 1198544134788 | 261675767808 | 34275177300 | 2038517600 | 58471805545067 | |
| 15 | 7923848253 | 313062555960 | 3215725236360 | 15988825681920 | 47821488214500 | 95440014397728 | 134431456799640 | 137830222632960 | 104380837510950 | 58494950514000 | 23992478085576 | 7009172352000 | 1382432151100 | 165119925600 | 9026235000 | 630482736141547 |
Compute more
?
Technical details
- Node id
n-6ec298dee79c9c3c· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-a9fc593edbc03cee
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, 54; 4: 63, 528, 810, 320; 5: 321, 3600, 8370, 6720, 1750; 6: 1683, 23640, 73710, 89600, 47250, 9072; 7: 8989, 151704, 593460, 967680, 771750, 299376, 45276; 8: 48639, 958496, 4511052, 9233280, 9875250, 5787936, 1765764, 219648; 9: 265729, 5988384, 32942700, 81164160, 108974250, 85621536, 39435396, 9884160, 1042470; 10: 1462563, 37097640, 233566740, 672967680, 1087836750, 1072863792, 662161500, 250398720, 53165970, 4862000;
%F FormulaThe row polynomials satisfy (16*n-16+(18*n-18)*x-(20*n^3-80*n^2+99*n-39)*x^2-(12*n^3-48*n^2+63*n-27)*x^3+(n^5-7*n^4+19*n^3-25*n^2+16*n-4)*x^4)*P(n,x) = (48*n-48+(56*n^2+14*n-70)*x-(60*n^3-252*n^2+189*n+3)*x^2-(8*n^4+56*n^3-240*n^2+209*n-33)*x^3+(3*n^5-21*n^4+15*n^3+51*n^2-60*n+12)*x^4+(2*n^5-10*n^4+16*n^3-8*n^2)*x^5)*P(n-1,x) + (16+72*x-(56*n^2-112*n-76)*x^2-(132*n^2-264*n+6)*x^3+(4*n^4-16*n^3-84*n^2+200*n-38)*x^4+(6*n^4-24*n^3+48*n-12)*x^5+(2*n^4-8*n^3+8*n^2)*x^6)*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[((48*n - 48 + (56*n^2 + 14*n - 70)*x - (60*n^3 - 252*n^2 + 189*n + 3)*x^2 - (8*n^4 + 56*n^3 - 240*n^2 + 209*n - 33)*x^3 + (3*n^5 - 21*n^4 + 15*n^3 + 51*n^2 - 60*n + 12)*x^4 + (2*n^5 - 10*n^4 + 16*n^3 - 8*n^2)*x^5)*P[n - 1, x] + (16 + 72*x - (56*n^2 - 112*n - 76)*x^2 - (132*n^2 - 264*n + 6)*x^3 + (4*n^4 - 16*n^3 - 84*n^2 + 200*n - 38)*x^4 + (6*n^4 - 24*n^3 + 48*n - 12)*x^5 + (2*n^4 - 8*n^3 + 8*n^2)*x^6)*D[P[n - 1, x], x])/(16*n - 16 + (18*n - 18)*x - (20*n^3 - 80*n^2 + 99*n - 39)*x^2 - (12*n^3 - 48*n^2 + 63*n - 27)*x^3 + (n^5 - 7*n^4 + 19*n^3 - 25*n^2 + 16*n - 4)*x^4)]];
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] = ((48*n - 48 + (56*n^2 + 14*n - 70)*x - (60*n^3 - 252*n^2 + 189*n + 3)*x^2 - (8*n^4 + 56*n^3 - 240*n^2 + 209*n - 33)*x^3 + (3*n^5 - 21*n^4 + 15*n^3 + 51*n^2 - 60*n + 12)*x^4 + (2*n^5 - 10*n^4 + 16*n^3 - 8*n^2)*x^5)*v[i - 1] + (16 + 72*x - (56*n^2 - 112*n - 76)*x^2 - (132*n^2 - 264*n + 6)*x^3 + (4*n^4 - 16*n^3 - 84*n^2 + 200*n - 38)*x^4 + (6*n^4 - 24*n^3 + 48*n - 12)*x^5 + (2*n^4 - 8*n^3 + 8*n^2)*x^6)*deriv(v[i - 1], x))/(16*n - 16 + (18*n - 18)*x - (20*n^3 - 80*n^2 + 99*n - 39)*x^2 - (12*n^3 - 48*n^2 + 63*n - 27)*x^3 + (n^5 - 7*n^4 + 19*n^3 - 25*n^2 + 16*n - 4)*x^4)); 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_A007318 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_A007318 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