A386789: Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*binomial(n + k, k).
A386789 ↗ nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence from A386789
\(\left(-n + n^{2}\right)\,P_{n}(x) = \left(1 + 2\,x - 3\,n - 6\,n x + 2\,n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x) + \left(2\,n - n^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 0 | 2 | 2 | ||||||
| 2 | 0 | 3 | 6 | 9 | |||||
| 3 | 0 | 4 | 20 | 20 | 44 | ||||
| 4 | 0 | 5 | 45 | 105 | 70 | 225 | |||
| 5 | 0 | 6 | 84 | 336 | 504 | 252 | 1182 | ||
| 6 | 0 | 7 | 140 | 840 | 2100 | 2310 | 924 | 6321 | |
| 7 | 0 | 8 | 216 | 1800 | 6600 | 11880 | 10296 | 3432 | 34232 |
All 15 rows b-files: A176479 (row sums), A386789 ?
Compute more
?
Technical details
- Node id
n-2fa133578d3075fe· revision 1 · JSON- Definition source
oeis_catalog:A386789- Fingerprint
f6-1e5fbd8fe1b88630
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 ?
Row sums ? A176479
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 0, 2; 2: 0, 3, 6; 3: 0, 4, 20, 20; 4: 0, 5, 45, 105, 70; 5: 0, 6, 84, 336, 504, 252; 6: 0, 7, 140, 840, 2100, 2310, 924; 7: 0, 8, 216, 1800, 6600, 11880, 10296, 3432; 8: 0, 9, 315, 3465, 17325, 45045, 63063, 45045, 12870; 9: 0, 10, 440, 6160, 40040, 140140, 280280, 320320, 194480, 48620;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (2*n^2-3*n+1+(4*n^2-6*n+2)*x)*P(n-1,x) - (n^2-2*n)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 3*n + 1 + (4*n^2 - 6*n + 2)*x)*P[n - 1, x] - (n^2 - 2*n)*P[n - 2, x])/(n^2 - n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n^2 - 3*n + 1 + (4*n^2 - 6*n + 2)*x)*v[i - 1] - (n^2 - 2*n)*v[i - 2])/(n^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
A386789 triangle, offset 0, from P0
%e ExampleTriangle begins: 0: 1; 1: 0, 2; 2: 0, 3, 6; 3: 0, 4, 20, 20; 4: 0, 5, 45, 105, 70; 5: 0, 6, 84, 336, 504, 252; 6: 0, 7, 140, 840, 2100, 2310, 924; 7: 0, 8, 216, 1800, 6600, 11880, 10296, 3432; 8: 0, 9, 315, 3465, 17325, 45045, 63063, 45045, 12870; 9: 0, 10, 440, 6160, 40040, 140140, 280280, 320320, 194480, 48620;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (2*n^2-3*n+1+(4*n^2-6*n+2)*x)*P(n-1,x) - (n^2-2*n)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 3*n + 1 + (4*n^2 - 6*n + 2)*x)*P[n - 1, x] - (n^2 - 2*n)*P[n - 2, x])/(n^2 - n)]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((2*n^2 - 3*n + 1 + (4*n^2 - 6*n + 2)*x)*v[i - 1] - (n^2 - 2*n)*v[i - 2])/(n^2 - n)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m ≥ 1
Proof chains ? JSON
-
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
Used in 12
- basis_map_A013610 of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*bi… Image under a basis map u^k -> P_k (A013610)
- basis_map_A013611 of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*bi… Image under a basis map u^k -> P_k (A013611)
- basis_map_A008277 of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*bi… Image under a basis map u^k -> P_k (A008277)
- basis_map_A013609 of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*bi… Image under a basis map u^k -> P_k (A013609)
- shift_x_plus_one of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*bin… Image under a basis map u^k -> P_k (A007318)
- mobius_x_over_x_plus_one of Triangle read by rows: T(n, k) = binomial(n - 1, k … Image under a real-rootedness preserver (mobius, shift 0)
- one_plus_derivative of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*… Image under a real-rootedness preserver (derivative polynomial, shift 0)
- derivative of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*binomial(… Image under a real-rootedness preserver (derivative polynomial, shift 0)
4 more
- theta_plus_one_squared of Triangle read by rows: T(n, k) = binomial(n - 1, k - … Image under a real-rootedness preserver (euler polynomial, shift 0)
- shift_x_plus_one of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*bin… Image under a real-rootedness preserver (affine, shift 0)
- theta_plus_one of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*binom… Image under a real-rootedness preserver (euler polynomial, shift 0)
- reversal of Triangle read by rows: T(n, k) = binomial(n - 1, k - 1)*binomial(n … Image under a real-rootedness preserver (reversal, shift 0)
Related ?
Same fingerprint ?
- A357367 → reverse
- A132812 → x ↦ x/(x+1)
- A367270 → D → x ↦ x+1
- A132812 → basis A007318
- narayana → x ↦ x/(x+1)
- narayana → basis A007318 → reverse
- narayana → basis A007318
- A386789 → reverse
- A114656 → basis A007318 → basis A013609
- A063007 → D
- A126216: Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but …
- A033282: Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
- A132812 → basis A007318 → reverse
- A357367: Triangle read by rows. T(n, k) = binomial(n - 1, k - 1)*(n + k)! / k!.
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.