A104684 → basis A013610 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-3 + 3\,n\right)\,P_{n}(x) = \left(-78 - 45\,x + 48\,n + 27\,n x\right)\,P_{n-1}(x) + \left(-40 - 54\,x - 18\,x^{2}\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 | 6 | 3 | 9 | |||||||||||||
| 3 | 46 | 42 | 9 | 97 | ||||||||||||
| 4 | 396 | 522 | 216 | 27 | 1161 | |||||||||||
| 5 | 3606 | 6228 | 3834 | 972 | 81 | 14721 | ||||||||||
| 6 | 33876 | 72450 | 59400 | 22950 | 4050 | 243 | 192969 | |||||||||
| 7 | 324556 | 828108 | 849150 | 442800 | 121500 | 16038 | 729 | 2582881 | ||||||||
| 8 | 3151896 | 9345252 | 11509344 | 7569450 | 2835000 | 591948 | 61236 | 2187 | 35066313 | |||||||
| 9 | 30915046 | 104454312 | 150212916 | 119343672 | 56785050 | 16343208 | 2714796 | 227448 | 6561 | 481003009 | ||||||
| 10 | 305543556 | 1158850098 | 1906051824 | 1775819052 | 1025968356 | 377550558 | 87200064 | 11888532 | 826686 | 19683 | 6649718409 | |||||
| 11 | 3038019876 | 12780582300 | 23664745350 | 25299604800 | 17205955200 | 7723512972 | 2294053650 | 438274800 | 50191650 | 2952450 | 59049 | 92497952097 | ||||
| 12 | 30354866856 | 140272922988 | 288758487600 | 348431742450 | 272720844000 | 144606691152 | 52611889176 | 12994388550 | 2100176100 | 205687350 | 10392624 | 177147 | 1293068265993 | |||
| 13 | 304523343996 | 1533394121112 | 3473972508204 | 4670201269800 | 4135592760750 | 2530590856992 | 1091012663664 | 331337638368 | 69565626900 | 9678131100 | 822316374 | 36137988 | 531441 | 18150727906689 | ||
| 14 | 3065412858696 | 16705674315252 | 41306298327216 | 61220562609492 | 60515949908700 | 41986105357482 | 20941857915264 | 7558609707792 | 1958266551384 | 355492694700 | 43165763784 | 3219469578 | 124357194 | 1594323 | 255660741430857 | |
| 15 | 30946859111256 | 181475744293368 | 486296104985964 | 787775207742432 | 859906327336056 | 667175687310132 | 378079727271246 | 158242282406208 | 48856506602904 | 10980384046632 | 1746997496244 | 187254299232 | 12380449536 | 424089918 | 4782969 | 3611681892224097 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(\left(1 - n\right)\,P_{n}(x) = \left(-32 - 48\,x - 18\,x^{2} + 16\,n + 24\,n x + 9\,n x^{2}\right)\,P_{n-2}(x) + \left(18 + 9\,x - 12\,n - 6\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 6 + 3\,x\)
Technical details
- Node id
n-7443809b677f8653· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-7fa92f96a89db90b)- Fingerprint
f6-42186a769c41ebed
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: 6, 3; 3: 46, 42, 9; 4: 396, 522, 216, 27; 5: 3606, 6228, 3834, 972, 81; 6: 33876, 72450, 59400, 22950, 4050, 243; 7: 324556, 828108, 849150, 442800, 121500, 16038, 729; 8: 3151896, 9345252, 11509344, 7569450, 2835000, 591948, 61236, 2187; 9: 30915046, 104454312, 150212916, 119343672, 56785050, 16343208, 2714796, 227448, 6561; 10: 305543556, 1158850098, 1906051824, 1775819052, 1025968356, 377550558, 87200064, 11888532, 826686, 19683;
%F FormulaThe row polynomials satisfy (3*n-3)*P(n,x) = (48*n-78+(27*n-45)*x)*P(n-1,x) - (40+54*x+18*x^2)*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 - 78 + (27*n - 45)*x)*P[n - 1, x] - (40 + 54*x + 18*x^2)*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] = ((48*n - 78 + (27*n - 45)*x)*v[i - 1] - (40 + 54*x + 18*x^2)*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 (−∞, -1]
- 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)
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
- 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_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,…?
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