A011973 → x ↦ x+2 (shift +1) → D+1
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · 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 | 18 | 9 | 1 | 28 | |||||
| 4 | 37 | 22 | 3 | 62 | |||||
| 5 | 84 | 65 | 15 | 1 | 165 | ||||
| 6 | 179 | 162 | 46 | 4 | 391 | ||||
| 7 | 390 | 417 | 153 | 22 | 1 | 983 | |||
| 8 | 833 | 1014 | 441 | 80 | 5 | 2373 | |||
| 9 | 1784 | 2457 | 1263 | 295 | 30 | 1 | 5830 | ||
| 10 | 3791 | 5810 | 3420 | 956 | 125 | 6 | 14108 | ||
| 11 | 8042 | 13609 | 9081 | 3004 | 505 | 39 | 1 | 34281 | |
| 12 | 16989 | 31446 | 23423 | 8912 | 1806 | 182 | 7 | 82765 | |
| 13 | 35804 | 72017 | 59343 | 25645 | 6160 | 798 | 49 | 1 | 199817 |
| 14 | 75243 | 163426 | 147594 | 71380 | 19790 | 3108 | 252 | 8 | 480801 |
Computed in your browser ?
Technical details
- Node id
n-f2b038a33436dda1· revision 1 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-6f025d7ab02f4150
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 ?
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: 4, 1; 2: 7, 2; 3: 18, 9, 1; 4: 37, 22, 3; 5: 84, 65, 15, 1; 6: 179, 162, 46, 4; 7: 390, 417, 153, 22, 1; 8: 833, 1014, 441, 80, 5; 9: 1784, 2457, 1263, 295, 30, 1;
%F FormulaThe row polynomials satisfy (n^3+9*n^2+14*n+6+(4*n^2+15*n+11)*x+(4*n+4)*x^2)*P(n,x) = (5*n^3+42*n^2+67*n+6+(2*n^3+36*n^2+101*n+11)*x+(8*n^2+50*n+4)*x^2+8*n*x^3)*P(n-1,x) - (18*n^2+180*n+414+(17*n^2+242*n+733)*x+(4*n^2+108*n+487)*x^2+(16*n+144)*x^3+16*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((5*n^3 + 42*n^2 + 67*n + 6 + (2*n^3 + 36*n^2 + 101*n + 11)*x + (8*n^2 + 50*n + 4)*x^2 + 8*n*x^3)*P[n - 1, x] - (18*n^2 + 180*n + 414 + (17*n^2 + 242*n + 733)*x + (4*n^2 + 108*n + 487)*x^2 + (16*n + 144)*x^3 + 16*x^4)*D[P[n - 1, x], x])/(n^3 + 9*n^2 + 14*n + 6 + (4*n^2 + 15*n + 11)*x + (4*n + 4)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((5*n^3 + 42*n^2 + 67*n + 6 + (2*n^3 + 36*n^2 + 101*n + 11)*x + (8*n^2 + 50*n + 4)*x^2 + 8*n*x^3)*v[i - 1] - (18*n^2 + 180*n + 414 + (17*n^2 + 242*n + 733)*x + (4*n^2 + 108*n + 487)*x^2 + (16*n + 144)*x^3 + 16*x^4)*deriv(v[i - 1], x))/(n^3 + 9*n^2 + 14*n + 6 + (4*n^2 + 15*n + 11)*x + (4*n + 4)*x^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)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-14d41bb220ff7187 -
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-14d41bb220ff7187 -
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-14d41bb220ff7187
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
-
preserver_image derivative_polynomial, shift 0
e-14d41bb220ff7187Laguerre’s theorem on differential operators [SP14] 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.
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.