A093562: (5,1) Pascal triangle.
A093562 ↗ nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0)coefficients of one signHadamard kernelinterlacing (weak)
Recurrence from A093562
\(\left(-1 + n\right)\,P_{n}(x) = \left(-1 - x + n + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 5 | 1 | 6 | ||||||
| 2 | 5 | 6 | 1 | 12 | |||||
| 3 | 5 | 11 | 7 | 1 | 24 | ||||
| 4 | 5 | 16 | 18 | 8 | 1 | 48 | |||
| 5 | 5 | 21 | 34 | 26 | 9 | 1 | 96 | ||
| 6 | 5 | 26 | 55 | 60 | 35 | 10 | 1 | 192 | |
| 7 | 5 | 31 | 81 | 115 | 95 | 45 | 11 | 1 | 384 |
All 15 rows b-files: A091629 (row sums), A093562 ?
Compute more
?
Technical details
- Node id
n-0c29381e3836fd28· revision 1 · JSON- Definition source
oeis_catalog:A093562- Fingerprint
f6-5bcf47c8067a6574
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 ℚ): yes
Matches ?
Row sums ? A091629, A058764, A007283, A042950, A111286, A167881, A003945, A082505
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 5, 1; 2: 5, 6, 1; 3: 5, 11, 7, 1; 4: 5, 16, 18, 8, 1; 5: 5, 21, 34, 26, 9, 1; 6: 5, 26, 55, 60, 35, 10, 1; 7: 5, 31, 81, 115, 95, 45, 11, 1; 8: 5, 36, 112, 196, 210, 140, 56, 12, 1; 9: 5, 41, 148, 308, 406, 350, 196, 68, 13, 1;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 5 + x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1])/(n - 1)); 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
A093562 triangle, offset 0, from P0
%e ExampleTriangle begins: 0: 1; 1: 5, 1; 2: 5, 6, 1; 3: 5, 11, 7, 1; 4: 5, 16, 18, 8, 1; 5: 5, 21, 34, 26, 9, 1; 6: 5, 26, 55, 60, 35, 10, 1; 7: 5, 31, 81, 115, 95, 45, 11, 1; 8: 5, 36, 112, 196, 210, 140, 56, 12, 1; 9: 5, 41, 148, 308, 406, 350, 196, 68, 13, 1;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];
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] = 5 + x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1])/(n - 1)); 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 ≥ 2
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- 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
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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.