A063007 → basis A013609 → 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(-12 - 15\,x - 4\,x^{2} + 8\,n + 9\,n x + 2\,n x^{2}\right)\,P_{n-1}(x) + \left(-4\,x - 6\,x^{2} - 2\,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 | 4 | 3 | 7 | |||||||||||||
| 3 | 24 | 36 | 13 | 73 | ||||||||||||
| 4 | 160 | 360 | 264 | 63 | 847 | |||||||||||
| 5 | 1120 | 3360 | 3720 | 1800 | 321 | 10321 | ||||||||||
| 6 | 8064 | 30240 | 44800 | 32760 | 11820 | 1683 | 129367 | |||||||||
| 7 | 59136 | 266112 | 493920 | 483840 | 263760 | 75852 | 8989 | 1651609 | ||||||||
| 8 | 439296 | 2306304 | 5144832 | 6320160 | 4616640 | 2004912 | 479248 | 48639 | 21360031 | |||||||
| 9 | 3294720 | 19768320 | 51507456 | 76108032 | 69743520 | 40582080 | 14641200 | 2994192 | 265729 | 278905249 | ||||||
| 10 | 24893440 | 168030720 | 500797440 | 864864000 | 953656704 | 696215520 | 336483840 | 103807440 | 18548820 | 1462563 | 3668760487 | |||||
| 11 | 189190144 | 1418926080 | 4760870400 | 9409720320 | 12131159040 | 10658583936 | 6462936480 | 2670370560 | 719496360 | 114148980 | 8097453 | 48543499753 | ||||
| 12 | 1444724736 | 11918979072 | 44459683840 | 98970094080 | 146074705920 | 150085039104 | 109530989568 | 56773997280 | 20482381920 | 4898064600 | 698734872 | 45046719 | 645382441711 | |||
| 13 | 11076222976 | 99686006784 | 409218281472 | 1013113221120 | 1684619988480 | 1981955948544 | 1691606332416 | 1055300133888 | 477557720640 | 152877684960 | 32861300472 | 4258447128 | 251595969 | 8614382884849 | ||
| 14 | 85201715200 | 830716723200 | 3721610919936 | 10143051190272 | 18762459555840 | 24873419450880 | 24311879454720 | 17738420603904 | 9660685402368 | 3878716121280 | 1115859064320 | 217820421000 | 25858331772 | 1409933619 | 115367108888311 | |
| 15 | 657270374400 | 6901338931200 | 33505574502400 | 99686006784000 | 203043781484544 | 299494146631680 | 329894992627200 | 275660445265920 | 175583943575040 | 84835568353536 | 30605752457280 | 7994412840960 | 1429211216160 | 156531277980 | 7923848253 | 1549456900170553 |
Compute more
?
Technical details
- Node id
n-89174466dc5ea2fd· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-79e2479186e12230
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: 4, 3; 3: 24, 36, 13; 4: 160, 360, 264, 63; 5: 1120, 3360, 3720, 1800, 321; 6: 8064, 30240, 44800, 32760, 11820, 1683; 7: 59136, 266112, 493920, 483840, 263760, 75852, 8989; 8: 439296, 2306304, 5144832, 6320160, 4616640, 2004912, 479248, 48639; 9: 3294720, 19768320, 51507456, 76108032, 69743520, 40582080, 14641200, 2994192, 265729; 10: 24893440, 168030720, 500797440, 864864000, 953656704, 696215520, 336483840, 103807440, 18548820, 1462563;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (8*n-12+(9*n-15)*x+(2*n-4)*x^2)*P(n-1,x) - (4*x+6*x^2+2*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[((8*n - 12 + (9*n - 15)*x + (2*n - 4)*x^2)*P[n - 1, x] - (4*x + 6*x^2 + 2*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] = ((8*n - 12 + (9*n - 15)*x + (2*n - 4)*x^2)*v[i - 1] - (4*x + 6*x^2 + 2*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_A013609 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_A013609 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