A063007 → 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(-54 - 45\,x - 8\,x^{2} + 36\,n + 27\,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 | 6 | 3 | 9 | |||||||||||||
| 3 | 54 | 54 | 13 | 121 | ||||||||||||
| 4 | 540 | 810 | 396 | 63 | 1809 | |||||||||||
| 5 | 5670 | 11340 | 8370 | 2700 | 321 | 28401 | ||||||||||
| 6 | 61236 | 153090 | 151200 | 73710 | 17730 | 1683 | 458649 | |||||||||
| 7 | 673596 | 2020788 | 2500470 | 1632960 | 593460 | 113778 | 8989 | 7544041 | ||||||||
| 8 | 7505784 | 26270244 | 39068568 | 31995810 | 15581160 | 4511052 | 718872 | 48639 | 125700129 | |||||||
| 9 | 84440070 | 337760280 | 586702116 | 577945368 | 353076570 | 136964520 | 32942700 | 4491288 | 265729 | 2114588641 | ||||||
| 10 | 956987460 | 4306443570 | 8556593760 | 9851341500 | 7241830596 | 3524591070 | 1135632960 | 233566740 | 27823230 | 1462563 | 35836273449 | |||||
| 11 | 10909657044 | 54548285220 | 122015901150 | 160773893280 | 138181483440 | 80938621764 | 32718615930 | 9012500640 | 1618866810 | 171223470 | 8097453 | 610897146201 | ||||
| 12 | 124965162504 | 687308393772 | 1709179603560 | 2536495262730 | 2495823295680 | 1709562398544 | 831750952032 | 287418361230 | 69128038980 | 11020645350 | 1048102308 | 45046719 | 10463745263409 | |||
| 13 | 1437099368796 | 8622596212776 | 23597588186172 | 38947475647080 | 43174967751630 | 33863575464576 | 19268453380176 | 8013685391712 | 2417635960740 | 515962186740 | 73937926062 | 6387670692 | 251595969 | 179939616743121 | ||
| 14 | 16581915793800 | 107782452659700 | 321910258610304 | 584899443099972 | 721291975464060 | 637478535223530 | 415391252870880 | 202051697191344 | 73360829774232 | 19636000363980 | 3766024342080 | 490095947250 | 38787497658 | 1409933619 | 3104680678772409 | |
| 15 | 191876454185400 | 1343135179297800 | 4347225590607900 | 8622596212776000 | 11708527590703944 | 11513561109670620 | 8454847838386950 | 4709917139035680 | 2000010857284440 | 644220097184664 | 154941621814980 | 26981143338240 | 3215725236360 | 234796916970 | 7923848253 | 53721299280288201 |
Compute more
?
Technical details
- Node id
n-c44e96619cc36843· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-7c3d3d10489865b7
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: 54, 54, 13; 4: 540, 810, 396, 63; 5: 5670, 11340, 8370, 2700, 321; 6: 61236, 153090, 151200, 73710, 17730, 1683; 7: 673596, 2020788, 2500470, 1632960, 593460, 113778, 8989; 8: 7505784, 26270244, 39068568, 31995810, 15581160, 4511052, 718872, 48639; 9: 84440070, 337760280, 586702116, 577945368, 353076570, 136964520, 32942700, 4491288, 265729; 10: 956987460, 4306443570, 8556593760, 9851341500, 7241830596, 3524591070, 1135632960, 233566740, 27823230, 1462563;
%F FormulaThe row polynomials satisfy (3*n-3)*P(n,x) = (36*n-54+(27*n-45)*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[((36*n - 54 + (27*n - 45)*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] = ((36*n - 54 + (27*n - 45)*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 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_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
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