A011973 → x ↦ x+2 (shift +1) → basis A007318
nonnegative coefficients
Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 1 | 5 | ||||||
| 2 | 7 | 2 | 9 | ||||||
| 3 | 19 | 9 | 1 | 29 | |||||
| 4 | 40 | 22 | 3 | 65 | |||||
| 5 | 97 | 68 | 15 | 1 | 181 | ||||
| 6 | 217 | 174 | 46 | 4 | 441 | ||||
| 7 | 508 | 475 | 159 | 22 | 1 | 1165 | |||
| 8 | 1159 | 1214 | 471 | 80 | 5 | 2929 | |||
| 9 | 2683 | 3147 | 1423 | 305 | 30 | 1 | 7589 | ||
| 10 | 6160 | 7948 | 4050 | 1016 | 125 | 6 | 19305 | ||
| 11 | 14209 | 20072 | 11466 | 3354 | 520 | 39 | 1 | 49661 | |
| 12 | 32689 | 50076 | 31564 | 10452 | 1911 | 182 | 7 | 126881 | |
| 13 | 75316 | 124501 | 86034 | 31980 | 6825 | 819 | 49 | 1 | 325525 |
| 14 | 173383 | 307418 | 230802 | 94900 | 23010 | 3276 | 252 | 8 | 833049 |
Computed in your browser ?
Other recurrences
X ↦ x+1 substitution · proved equal for all n (proof step)
Technical details
- Node id
n-e7968148eadb4da9· revision 2 · JSON- Definition source
derived:basis_map_A007318derived:shift_x_plus_one(equal bye-77c981b6ee1f3c8e)- Fingerprint
f6-f87a8c920f61a688
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half affine: slope 1, intercept 1)
- 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 ?
- A006131: 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: 4, 1; 2: 7, 2; 3: 19, 9, 1; 4: 40, 22, 3; 5: 97, 68, 15, 1; 6: 217, 174, 46, 4; 7: 508, 475, 159, 22, 1; 8: 1159, 1214, 471, 80, 5; 9: 2683, 3147, 1423, 305, 30, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (3+x)*P(n-2,x) + P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + x;
P[n_, x_] := P[n, x] = Expand[(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] = 4 + x; for(n = 2, N, my(i = n + 1); v[i] = (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-16890f4567488209 -
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-16890f4567488209,e-8280e16be483f9ab -
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-16890f4567488209,e-8280e16be483f9ab -
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-8280e16be483f9ab
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-16890f4567488209Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image affine, shift 1
e-7fc1b55fb0aa373aAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers paper_theorem
e-0801036cdfff24d2root: theorem checkParent-row provers of polytool polytool ?
-
parent_provers paper_theorem
e-0d3631d0f359c9ceroot: theorem checkParent-row provers of polytool polytool ?
-
gamma_polynomial scale 1, shift 0
e-a039cba7823b0b25Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
delannoy
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-15c233e4385971d1root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-266d85ca03a298faAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
delannoy
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-15c233e4385971d1(expanded above) -
basis_map A008288
e-e771e35dc9ee3fbdAffine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
basis_map A008288
e-33dba7e79fe9caa8Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
↵ theorem_check liu_wang_derivative_lag
-
premise (sequence):
delannoy
-
↵ basis_map A008288
e-e771e35dc9ee3fbd(expanded above) -
↵ basis_map A008288
e-33dba7e79fe9caa8(expanded above)
-
-
premise (sequence):
delannoy
-
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
-
-
premise (sequence):
Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
-
definition_equality
e-77c981b6ee1f3c8eroot: theorem checkOre-algebra identity of two definitions polytool ?
-
preserver_image affine, shift 0
e-8280e16be483f9abAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
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