A304236 → basis A007318
nonnegative coefficients
Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 1 | 1 | |||
| 2 | 4 | 3 | 7 | ||
| 3 | 7 | 6 | 13 | ||
| 4 | 19 | 27 | 9 | 55 | |
| 5 | 40 | 66 | 27 | 133 | |
| 6 | 97 | 204 | 135 | 27 | 463 |
| 7 | 217 | 522 | 414 | 108 | 1261 |
Computed in your browser ?
Other recurrences
X ↦ x+1 substitution · proved equal for all n (proof step)
Technical details
- Node id
n-4d868f67dfcfb6b7· revision 2 · JSON- Definition source
derived:basis_map_A007318derived:shift_x_plus_one(equal bye-042af135dc6424b4)- Fingerprint
f6-a02f8a554f041708
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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 ?
- A015441: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
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: 1; 2: 4, 3; 3: 7, 6; 4: 19, 27, 9; 5: 40, 66, 27; 6: 97, 204, 135, 27; 7: 217, 522, 414, 108; 8: 508, 1425, 1431, 594, 81; 9: 1159, 3642, 4239, 2160, 405;
%F FormulaThe row polynomials satisfy P(n,x) = (3+3*x)*P(n-2,x) + P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3 + 3*x)*P[n - 2, 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] = 1; for(n = 2, N, my(i = n + 1); v[i] = (3 + 3*x)*v[i - 2] + 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-3091186ded9433db -
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-3091186ded9433db,e-4cdd530d16220003 -
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-3091186ded9433db,e-4cdd530d16220003 -
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-3091186ded9433db -
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-4cdd530d16220003
Proof chains
3 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
basis_map A007318
e-3091186ded9433dbGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers paper_theorem
e-0050d566ad712b7droot: theorem checkParent-row provers of polytool polytool ?
-
gamma_polynomial scale 1, shift 0
e-64b74724257dbeaaGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Pascal-(1,3,1) array.
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-fba968684828f914root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-86685874cd5f1179Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Pascal-(1,3,1) array.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Pascal-(1,3,1) array.
-
-
premise (sequence):
Pascal-(1,3,1) array.
-
-
premise (sequence):
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…
-
definition_equality
e-042af135dc6424b4root: theorem checkOre-algebra identity of two definitions polytool ?
-
preserver_image affine, shift 0
e-4cdd530d16220003Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by ro…
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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