A063007 → x ↦ x+1 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - n\right)\,P_{n}(x) = \left(-2 + n\right)\,P_{n-2}(x) + \left(15 + 12\,x - 10\,n - 8\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 5 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 5 | 4 | 9 | |||||||||||||
| 3 | 37 | 60 | 24 | 121 | ||||||||||||
| 4 | 305 | 744 | 600 | 160 | 1809 | |||||||||||
| 5 | 2641 | 8600 | 10440 | 5600 | 1120 | 28401 | ||||||||||
| 6 | 23525 | 95820 | 155400 | 125440 | 50400 | 8064 | 458649 | |||||||||
| 7 | 213445 | 1043700 | 2118480 | 2284800 | 1380960 | 443520 | 59136 | 7544041 | ||||||||
| 8 | 1961825 | 11194960 | 27291600 | 36845760 | 29752800 | 14370048 | 3843840 | 439296 | 125700129 | |||||||
| 9 | 18205345 | 118753200 | 337967280 | 548116800 | 554067360 | 357477120 | 143759616 | 32947200 | 3294720 | 2114588641 | ||||||
| 10 | 170195525 | 1249158420 | 4064900400 | 7697437440 | 9347738400 | 7549686144 | 4055251200 | 1396961280 | 280051200 | 24893440 | 35836273449 | |||||
| 11 | 1600472677 | 13053613100 | 47805987240 | 103525593600 | 146805378720 | 142443100800 | 95773117440 | 44061388800 | 13274426880 | 2364876800 | 189190144 | 610897146201 | ||||
| 12 | 15122515985 | 135688863288 | 552316650600 | 1346265080160 | 2183385204000 | 2473880048640 | 1998258662400 | 1150674370560 | 462924633600 | 123919544320 | 19864965120 | 1444724736 | 10463745263409 | |||
| 13 | 143457011569 | 1404325083720 | 6289493698488 | 17041236212000 | 31110902222400 | 40316730854400 | 38028600529920 | 26306889523200 | 13246029688320 | 4734483353600 | 1140248997888 | 166143344640 | 11076222976 | 179939616743121 | ||
| 14 | 1365435096485 | 14481390020188 | 70768570836600 | 210996055029760 | 428214290504000 | 624691924496640 | 673943772902400 | 544416396226560 | 329299043673600 | 147302027192320 | 47364698501120 | 10367344705536 | 1384527872000 | 85201715200 | 3104680678772409 | |
| 15 | 13033485491077 | 148871315504100 | 788284554788640 | 2564709786329600 | 5728004388025920 | 9289745405740800 | 11282483241469440 | 10424296528588800 | 7362867378746880 | 3956323007436800 | 1592002142674944 | 465201364992000 | 93317178572800 | 11502231552000 | 657270374400 | 53721299280288201 |
Compute more
?
Technical details
- Node id
n-2c425b900cc995ac· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-08ad261863ddeed5
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: 5, 4; 3: 37, 60, 24; 4: 305, 744, 600, 160; 5: 2641, 8600, 10440, 5600, 1120; 6: 23525, 95820, 155400, 125440, 50400, 8064; 7: 213445, 1043700, 2118480, 2284800, 1380960, 443520, 59136; 8: 1961825, 11194960, 27291600, 36845760, 29752800, 14370048, 3843840, 439296; 9: 18205345, 118753200, 337967280, 548116800, 554067360, 357477120, 143759616, 32947200, 3294720; 10: 170195525, 1249158420, 4064900400, 7697437440, 9347738400, 7549686144, 4055251200, 1396961280, 280051200, 24893440;
%F FormulaThe row polynomials satisfy -(n-1)*P(n,x) = (n-2)*P(n-2,x) - (10*n-15+(8*n-12)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 5 + 4*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 5 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 2, x] - (10*n - 15 + (8*n - 12)*x)*P[n - 1, x])/(-n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 5 + 4*x; for(n = 3, N, my(i = n); v[i] = ((n - 2)*v[i - 2] - (10*n - 15 + (8*n - 12)*x)*v[i - 1])/(-n + 1)); 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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (elementary) 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