A026386: Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1.
A026386 ↗ palindromicγ-positivenonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence from A026386
\(\left(-2 + n\right)\,P_{n}(x) = \left(-2 - 6\,x - 2\,x^{2} + n + 3\,n x + n x^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + x\)
\(P_{2}(x) = 1 + 2\,x + x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 1 | 2 | |||||||||||||
| 2 | 1 | 2 | 1 | 4 | ||||||||||||
| 3 | 1 | 4 | 4 | 1 | 10 | |||||||||||
| 4 | 1 | 5 | 8 | 5 | 1 | 20 | ||||||||||
| 5 | 1 | 7 | 17 | 17 | 7 | 1 | 50 | |||||||||
| 6 | 1 | 8 | 24 | 34 | 24 | 8 | 1 | 100 | ||||||||
| 7 | 1 | 10 | 39 | 75 | 75 | 39 | 10 | 1 | 250 | |||||||
| 8 | 1 | 11 | 49 | 114 | 150 | 114 | 49 | 11 | 1 | 500 | ||||||
| 9 | 1 | 13 | 70 | 202 | 339 | 339 | 202 | 70 | 13 | 1 | 1250 | |||||
| 10 | 1 | 14 | 83 | 272 | 541 | 678 | 541 | 272 | 83 | 14 | 1 | 2500 | ||||
| 11 | 1 | 16 | 110 | 425 | 1015 | 1558 | 1558 | 1015 | 425 | 110 | 16 | 1 | 6250 | |||
| 12 | 1 | 17 | 126 | 535 | 1440 | 2573 | 3116 | 2573 | 1440 | 535 | 126 | 17 | 1 | 12500 | ||
| 13 | 1 | 19 | 159 | 771 | 2400 | 5028 | 7247 | 7247 | 5028 | 2400 | 771 | 159 | 19 | 1 | 31250 | |
| 14 | 1 | 20 | 178 | 930 | 3171 | 7428 | 12275 | 14494 | 12275 | 7428 | 3171 | 930 | 178 | 20 | 1 | 62500 |
b-files: A026386, A026386 (reversed triangle), A026395 (row sums) ?
Compute more
?
Technical details
- Node id
n-e9d97f6728dd613c· revision 0 · JSON- Definition source
oeis_catalog:A026386- Fingerprint
f6-30879770cb7d11f9
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: yes
- γ-positive (gamma_positive): yes
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
Matches ?
- A026386 triangle 68 terms, 11 rows · tabl · nonn · catalog b-file?
- A026386 reversed triangle 68 terms, 11 rows · tabl · nonn · catalog b-file?
Row sums ? A026395
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 1, 1; 2: 1, 2, 1; 3: 1, 4, 4, 1; 4: 1, 5, 8, 5, 1; 5: 1, 7, 17, 17, 7, 1; 6: 1, 8, 24, 34, 24, 8, 1; 7: 1, 10, 39, 75, 75, 39, 10, 1; 8: 1, 11, 49, 114, 150, 114, 49, 11, 1; 9: 1, 13, 70, 202, 339, 339, 202, 70, 13, 1;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x+(n-2)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 1 + 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*P[n - 2, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*v[i - 2])/(n - 2)); 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
A026386 triangle, offset 0, from P0
%e ExampleTriangle begins: 0: 1; 1: 1, 1; 2: 1, 2, 1; 3: 1, 4, 4, 1; 4: 1, 5, 8, 5, 1; 5: 1, 7, 17, 17, 7, 1; 6: 1, 8, 24, 34, 24, 8, 1; 7: 1, 10, 39, 75, 75, 39, 10, 1; 8: 1, 11, 49, 114, 150, 114, 49, 11, 1; 9: 1, 13, 70, 202, 339, 339, 202, 70, 13, 1;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x+(n-2)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 1 + 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*P[n - 2, x])/(n - 2)]];
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] = 1 + x; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*v[i - 2])/(n - 2)); 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
A026386 reversed triangle, offset 0, from P0
%e ExampleTriangle begins: 0: 1; 1: 1, 1; 2: 1, 2, 1; 3: 1, 4, 4, 1; 4: 1, 5, 8, 5, 1; 5: 1, 7, 17, 17, 7, 1; 6: 1, 8, 24, 34, 24, 8, 1; 7: 1, 10, 39, 75, 75, 39, 10, 1; 8: 1, 11, 49, 114, 150, 114, 49, 11, 1; 9: 1, 13, 70, 202, 339, 339, 202, 70, 13, 1;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where (n-2)*P(n,x) = (n-2+(3*n-6)*x+(n-2)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 1 + 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*P[n - 2, x])/(n - 2)]];
Table[Reverse[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] = 1 + x; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x + (n - 2)*x^2)*v[i - 2])/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(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
derived from Iterated real-rootedness preservers
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Iterated real-rootedness preservers
Proof chains ? JSON
Used in 5
- basis_map_A007318 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for a… Image under a basis map u^k -> P_k (A007318)
- basis_map_A013610 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for a… Image under a basis map u^k -> P_k (A013610)
- basis_map_A013609 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for a… Image under a basis map u^k -> P_k (A013609)
- basis_map_A008277 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for a… Image under a basis map u^k -> P_k (A008277)
- basis_map_A013611 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for a… Image under a basis map u^k -> P_k (A013611)
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.