A104684 → basis A007318 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-1 + x + 8\,x^{2} + n + n x - 4\,n x^{2}\right)\,P_{n-1}(x) + \left(2\,x + 6\,x^{2} + 4\,x^{3}\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 | 1 | 3 | 4 | |||||||||||||
| 3 | 1 | 8 | 13 | 22 | ||||||||||||
| 4 | 1 | 15 | 57 | 63 | 136 | |||||||||||
| 5 | 1 | 24 | 156 | 384 | 321 | 886 | ||||||||||
| 6 | 1 | 35 | 340 | 1380 | 2505 | 1683 | 5944 | |||||||||
| 7 | 1 | 48 | 645 | 3800 | 11145 | 16008 | 8989 | 40636 | ||||||||
| 8 | 1 | 63 | 1113 | 8855 | 37065 | 84903 | 100849 | 48639 | 281488 | |||||||
| 9 | 1 | 80 | 1792 | 18368 | 102340 | 330848 | 621040 | 628736 | 265729 | 1968934 | ||||||
| 10 | 1 | 99 | 2736 | 34944 | 247716 | 1055628 | 2774352 | 4408848 | 3888657 | 1462563 | 13875544 | |||||
| 11 | 1 | 120 | 4005 | 62160 | 543060 | 2919168 | 10041780 | 22209120 | 30589065 | 23900040 | 8097453 | 98365972 | ||||
| 12 | 1 | 143 | 5665 | 104775 | 1101540 | 7241388 | 31222884 | 89899260 | 171521625 | 208411335 | 146146473 | 45046719 | 700701808 | |||
| 13 | 1 | 168 | 7788 | 168960 | 2098305 | 16484688 | 86427264 | 310394304 | 767708865 | 1287357720 | 1399199868 | 889928064 | 251595969 | 5011371964 | ||
| 14 | 1 | 195 | 10452 | 262548 | 3794505 | 34992243 | 218103600 | 948220416 | 2913982929 | 6312758595 | 9439841268 | 9279936900 | 5399971161 | 1409933619 | 35961808432 | |
| 15 | 1 | 224 | 13741 | 395304 | 6567561 | 70078008 | 510266757 | 2626557648 | 9736383657 | 26124706608 | 50326289013 | 67892966232 | 60919688193 | 32668236552 | 7923848253 | 258805997752 |
Compute more
?
Technical details
- Node id
n-7954740262dbc1d9· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-c880512e8efe320e
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: 1, 3; 3: 1, 8, 13; 4: 1, 15, 57, 63; 5: 1, 24, 156, 384, 321; 6: 1, 35, 340, 1380, 2505, 1683; 7: 1, 48, 645, 3800, 11145, 16008, 8989; 8: 1, 63, 1113, 8855, 37065, 84903, 100849, 48639; 9: 1, 80, 1792, 18368, 102340, 330848, 621040, 628736, 265729; 10: 1, 99, 2736, 34944, 247716, 1055628, 2774352, 4408848, 3888657, 1462563;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (n-1+(n+1)*x-(4*n-8)*x^2)*P(n-1,x) + (2*x+6*x^2+4*x^3)*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[((n - 1 + (n + 1)*x - (4*n - 8)*x^2)*P[n - 1, x] + (2*x + 6*x^2 + 4*x^3)*D[P[n - 1, x], x])/(n - 1)]];
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] = ((n - 1 + (n + 1)*x - (4*n - 8)*x^2)*v[i - 1] + (2*x + 6*x^2 + 4*x^3)*deriv(v[i - 1], x))/(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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
-
Geometric basis map (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.?
-
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) (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,…?
- ↑ 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.?
- ↑ 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,…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
Related ?
Candidate equalities ?
- A063007 → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
Same fingerprint ?
- A109983 → x ↦ x/(x+1)
- A008459 → x ↦ x+1 → basis A007318
- A104684 → basis A007318
- A069466 → basis A007318 → x ↦ x+1
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