A154228 → basis A013610
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 3 | 5 | ||||||
| 2 | 18 | 54 | 9 | 81 | |||||
| 3 | 96 | 432 | 450 | 27 | 1005 | ||||
| 4 | 1182 | 7092 | 11601 | 2889 | 81 | 22845 | |||
| 5 | 11100 | 83250 | 203364 | 165888 | 16200 | 243 | 480045 | ||
| 6 | 187680 | 1689120 | 5259258 | 6218748 | 1754784 | 83106 | 729 | 15193425 | |
| 7 | 2639760 | 27717480 | 108021132 | 186515190 | 126994068 | 15394536 | 399492 | 2187 | 467683845 |
Computed in your browser ?
Technical details
- Node id
n-f2c21dbd93280ce5· revision 1 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-107adb7d38961a2c
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
OEIS matches ?
No OEIS matches.
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 3; 2: 18, 54, 9; 3: 96, 432, 450, 27; 4: 1182, 7092, 11601, 2889, 81; 5: 11100, 83250, 203364, 165888, 16200, 243; 6: 187680, 1689120, 5259258, 6218748, 1754784, 83106, 729; 7: 2639760, 27717480, 108021132, 186515190, 126994068, 15394536, 399492, 2187; 8: 58768320, 705219840, 3242280834, 6966102546, 6630676686, 1935796806, 118245987, 1826145, 6561; 9: 1133844240, 15306897240, 82202046408, 220231803204, 298477421640, 176368668570, 23978375892, 820645506, 8017542, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = ((1/3)*n^3+(3/2)*n^2+(13/6)*n+1+(n^3+(9/2)*n^2+(13/2)*n+3)*x)*P(n-2,x) + (2+3*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 3*x;
P[n_, x_] := P[n, x] = Expand[((1/3)*n^3 + (3/2)*n^2 + (13/6)*n + 1 + (n^3 + (9/2)*n^2 + (13/2)*n + 3)*x)*P[n - 2, x] + (2 + 3*x)*P[n - 1, x]];
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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((1/3)*n^3 + (3/2)*n^2 + (13/6)*n + 1 + (n^3 + (9/2)*n^2 + (13/2)*n + 3)*x)*v[i - 2] + (2 + 3*x)*v[i - 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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-bbc3c7bdcf5b3d8a -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-bbc3c7bdcf5b3d8a -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-bbc3c7bdcf5b3d8a -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-bbc3c7bdcf5b3d8a
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
basis_map A013610
e-bbc3c7bdcf5b3d8aGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)*(2*n+3)/6)*T(n-2, k-1), read by rows.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang_derivative_lag
e-a3c76982c9b6ad3froot: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
-
premise (sequence):
Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)*(2*n+3)/6)*T(n-2, k-1), read by rows.
Related sequences ?
No candidate equalities or related sequences.
References
- [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