A357613 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2\,n + 4\,n^{2}\right)\,P_{n}(x) = \left(3 + 3\,x - 13\,n - 15\,n x + 14\,n^{2} + 18\,n^{2} x\right)\,P_{n-1}(x) + \left(-3\,x - 3\,x^{2} + n + 10\,n x + 9\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 3 | 5 | ||||||
| 2 | 6 | 20 | 15 | 41 | |||||
| 3 | 20 | 105 | 168 | 84 | 377 | ||||
| 4 | 70 | 504 | 1260 | 1320 | 495 | 3649 | |||
| 5 | 252 | 2310 | 7920 | 12870 | 10010 | 3003 | 36365 | ||
| 6 | 924 | 10296 | 45045 | 100100 | 120120 | 74256 | 18564 | 369305 | |
| 7 | 3432 | 45045 | 240240 | 680680 | 1113840 | 1058148 | 542640 | 116280 | 3800305 |
Compute more
?
Technical details
- Node id
n-6dafc159e8998123· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-1cc143b67a71a4b2
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 0)
- 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 3; 2: 6, 20, 15; 3: 20, 105, 168, 84; 4: 70, 504, 1260, 1320, 495; 5: 252, 2310, 7920, 12870, 10010, 3003; 6: 924, 10296, 45045, 100100, 120120, 74256, 18564; 7: 3432, 45045, 240240, 680680, 1113840, 1058148, 542640, 116280; 8: 12870, 194480, 1225224, 4232592, 8817900, 11395440, 8953560, 3922512, 735471; 9: 48620, 831402, 6046560, 24690120, 62674920, 102965940, 109830336, 73547100, 28120950, 4686825;
%F FormulaThe row polynomials satisfy (4*n^2-2*n)*P(n,x) = (14*n^2-13*n+3+(18*n^2-15*n+3)*x)*P(n-1,x) + (n+(10*n-3)*x+(9*n-3)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((14*n^2 - 13*n + 3 + (18*n^2 - 15*n + 3)*x)*P[n - 1, x] + (n + (10*n - 3)*x + (9*n - 3)*x^2)*D[P[n - 1, x], x])/(4*n^2 - 2*n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((14*n^2 - 13*n + 3 + (18*n^2 - 15*n + 3)*x)*v[i - 1] + (n + (10*n - 3)*x + (9*n - 3)*x^2)*deriv(v[i - 1], x))/(4*n^2 - 2*n)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows T(n, k) = binomial(2*n, k) * binomial(3*n - k, 2*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) = binomial(2*n, k) * binomial(3*n - k, 2*n).?
Related ?
Same fingerprint ?
- A110608 → x ↦ x/(x+1)
- A357613: Triangle read by rows T(n, k) = binomial(2*n, k) * binomial(3*n - k, 2*n).
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.