A386789 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(-2 - 3\,x + 4\,n + 3\,n x\right)\,P_{n-1}(x) + \left(-2\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||||||||
| 1 | 2 | 2 | |||||||||||||
| 2 | 6 | 3 | 9 | ||||||||||||
| 3 | 20 | 20 | 4 | 44 | |||||||||||
| 4 | 70 | 105 | 45 | 5 | 225 | ||||||||||
| 5 | 252 | 504 | 336 | 84 | 6 | 1182 | |||||||||
| 6 | 924 | 2310 | 2100 | 840 | 140 | 7 | 6321 | ||||||||
| 7 | 3432 | 10296 | 11880 | 6600 | 1800 | 216 | 8 | 34232 | |||||||
| 8 | 12870 | 45045 | 63063 | 45045 | 17325 | 3465 | 315 | 9 | 187137 | ||||||
| 9 | 48620 | 194480 | 320320 | 280280 | 140140 | 40040 | 6160 | 440 | 10 | 1030490 | |||||
| 10 | 184756 | 831402 | 1575288 | 1633632 | 1009008 | 378378 | 84084 | 10296 | 594 | 11 | 5707449 | ||||
| 11 | 705432 | 3527160 | 7558200 | 9069840 | 6683040 | 3118752 | 917280 | 163800 | 16380 | 780 | 12 | 31760676 | |||
| 12 | 2704156 | 14872858 | 35565530 | 48498450 | 41570100 | 23279256 | 8576568 | 2042040 | 300300 | 25025 | 1001 | 13 | 177435297 | ||
| 13 | 10400600 | 62403600 | 164745504 | 251694520 | 246222900 | 161164080 | 71628480 | 21488544 | 4241160 | 523600 | 36960 | 1260 | 14 | 994551222 | |
| 14 | 40116600 | 260757900 | 753300600 | 1274816400 | 1402298040 | 1051723530 | 548725320 | 199536480 | 49884120 | 8314020 | 875160 | 53040 | 1560 | 15 | 5590402785 |
Compute more
?
Technical details
- Node id
n-a5b9963ed656fa3c· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-1e5fbd8fe1b88630
Observed on the stored rows ?
- Degrees: 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (irregular)
- 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; 2: 6, 3; 3: 20, 20, 4; 4: 70, 105, 45, 5; 5: 252, 504, 336, 84, 6; 6: 924, 2310, 2100, 840, 140, 7; 7: 3432, 10296, 11880, 6600, 1800, 216, 8; 8: 12870, 45045, 63063, 45045, 17325, 3465, 315, 9; 9: 48620, 194480, 320320, 280280, 140140, 40040, 6160, 440, 10;
%F FormulaThe row polynomials satisfy n*P(n,x) = (4*n-2+(3*n-3)*x)*P(n-1,x) - (2*x+2*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[((4*n - 2 + (3*n - 3)*x)*P[n - 1, x] - (2*x + 2*x^2)*D[P[n - 1, x], x])/(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] = ((4*n - 2 + (3*n - 3)*x)*v[i - 1] - (2*x + 2*x^2)*deriv(v[i - 1], x))/(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(n - 1, k - 1)*binomial(n + k, k).?
-
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(n - 1, k - 1)*binomial(n + k, k).?
Related ?
Same fingerprint ?
- A063007 → D
- narayana → x ↦ x/(x+1)
- A367270 → D → x ↦ x+1
- narayana → basis A007318
- A033282: Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
- A357367: Triangle read by rows. T(n, k) = binomial(n - 1, k - 1)*(n + k)! / k!.
- A126216: Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but …
- A386789: Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*binomial(n + k, k).
- A132812 → basis A007318 → reverse
- A357367 → reverse
- A132812 → basis A007318
- A132812 → x ↦ x/(x+1)
- narayana → basis A007318 → reverse
- A114656 → basis A007318 → basis A013609
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
- [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.