A104684 → basis A013610 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-3 + 3\,n\right)\,P_{n}(x) = \left(-9 + 3\,x + 8\,x^{2} + 9\,n + 3\,n x - 4\,n x^{2}\right)\,P_{n-1}(x) + \left(18\,x + 18\,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 | 3 | 3 | 6 | |||||||||||||
| 3 | 9 | 24 | 13 | 46 | ||||||||||||
| 4 | 27 | 135 | 171 | 63 | 396 | |||||||||||
| 5 | 81 | 648 | 1404 | 1152 | 321 | 3606 | ||||||||||
| 6 | 243 | 2835 | 9180 | 12420 | 7515 | 1683 | 33876 | |||||||||
| 7 | 729 | 11664 | 52245 | 102600 | 100305 | 48024 | 8989 | 324556 | ||||||||
| 8 | 2187 | 45927 | 270459 | 717255 | 1000755 | 764127 | 302547 | 48639 | 3151896 | |||||||
| 9 | 6561 | 174960 | 1306368 | 4463424 | 8289540 | 8932896 | 5589360 | 1886208 | 265729 | 30915046 | ||||||
| 10 | 19683 | 649539 | 5983632 | 25474176 | 60194988 | 85505868 | 74907504 | 39679632 | 11665971 | 1462563 | 305543556 | |||||
| 11 | 59049 | 2361960 | 26276805 | 135943920 | 395890740 | 709357824 | 813384180 | 599646240 | 275301585 | 71700120 | 8097453 | 3038019876 | ||||
| 12 | 177147 | 8444007 | 111504195 | 687428775 | 2409067980 | 5278971852 | 7587160812 | 7281840060 | 4631083875 | 1875702015 | 438439419 | 45046719 | 30354866856 | |||
| 13 | 531441 | 29760696 | 459873612 | 3325639680 | 13766979105 | 36052012656 | 63005475456 | 75425815872 | 62184418065 | 34758658440 | 12592798812 | 2669784192 | 251595969 | 304523343996 | ||
| 14 | 1594323 | 103630995 | 1851540444 | 15503196852 | 74687241915 | 229584106323 | 476992573200 | 691252683264 | 708097851747 | 511333446195 | 254875714236 | 83519432100 | 16199913483 | 1409933619 | 3065412858696 | |
| 15 | 4782969 | 357128352 | 7302530781 | 70026917688 | 387807909489 | 1379345431464 | 3347860192677 | 5744281576176 | 7097823685953 | 6348303705744 | 4076429410053 | 1833110088264 | 548277193737 | 98004709656 | 7923848253 | 30946859111256 |
Compute more
?
Technical details
- Node id
n-68e54766ae0dd6bf· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-3d3f3d7068653107
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, 3; 3: 9, 24, 13; 4: 27, 135, 171, 63; 5: 81, 648, 1404, 1152, 321; 6: 243, 2835, 9180, 12420, 7515, 1683; 7: 729, 11664, 52245, 102600, 100305, 48024, 8989; 8: 2187, 45927, 270459, 717255, 1000755, 764127, 302547, 48639; 9: 6561, 174960, 1306368, 4463424, 8289540, 8932896, 5589360, 1886208, 265729; 10: 19683, 649539, 5983632, 25474176, 60194988, 85505868, 74907504, 39679632, 11665971, 1462563;
%F FormulaThe row polynomials satisfy (3*n-3)*P(n,x) = (9*n-9+(3*n+3)*x-(4*n-8)*x^2)*P(n-1,x) + (18*x+18*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[((9*n - 9 + (3*n + 3)*x - (4*n - 8)*x^2)*P[n - 1, x] + (18*x + 18*x^2 + 4*x^3)*D[P[n - 1, x], x])/(3*n - 3)]];
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] = ((9*n - 9 + (3*n + 3)*x - (4*n - 8)*x^2)*v[i - 1] + (18*x + 18*x^2 + 4*x^3)*deriv(v[i - 1], x))/(3*n - 3)); 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_A013610 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 ›
-
-
from
basis_map_A013610 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 ?
Same fingerprint ?
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