A133087 → θ+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 | 2 | 2 | 4 | ||||||
| 2 | 1 | 4 | 3 | 8 | |||||
| 3 | 2 | 10 | 12 | 4 | 28 | ||||
| 4 | 1 | 8 | 18 | 16 | 5 | 48 | |||
| 5 | 2 | 18 | 48 | 56 | 30 | 6 | 160 | ||
| 6 | 1 | 12 | 45 | 80 | 75 | 36 | 7 | 256 | |
| 7 | 2 | 26 | 108 | 220 | 250 | 162 | 56 | 8 | 832 |
Computed in your browser ?
Technical details
- Node id
n-807ef072d75ecee1· revision 1 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-464af00297143757
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, 2; 2: 1, 4, 3; 3: 2, 10, 12, 4; 4: 1, 8, 18, 16, 5; 5: 2, 18, 48, 56, 30, 6; 6: 1, 12, 45, 80, 75, 36, 7; 7: 2, 26, 108, 220, 250, 162, 56, 8; 8: 1, 16, 84, 224, 350, 336, 196, 64, 9; 9: 2, 34, 192, 560, 980, 1092, 784, 352, 90, 10;
%F FormulaThe row polynomials satisfy (2+2*n*x+(n^2-n)*x^2)*P(n,x) = -(6*n-10+(9*n^2-11*n-6)*x+(3*n^3-7*n)*x^2+(2*n^3-3*n^2-n+2)*x^3)*P(n-1,x) + (3+(6*n+4)*x+(3*n^2+9*n)*x^2+(5*n^2+3*n-2)*x^3+(2*n^2-1)*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[(-(6*n - 10 + (9*n^2 - 11*n - 6)*x + (3*n^3 - 7*n)*x^2 + (2*n^3 - 3*n^2 - n + 2)*x^3)*P[n - 1, x] + (3 + (6*n + 4)*x + (3*n^2 + 9*n)*x^2 + (5*n^2 + 3*n - 2)*x^3 + (2*n^2 - 1)*x^4)*D[P[n - 1, x], x])/(2 + 2*n*x + (n^2 - n)*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] = (-(6*n - 10 + (9*n^2 - 11*n - 6)*x + (3*n^3 - 7*n)*x^2 + (2*n^3 - 3*n^2 - n + 2)*x^3)*v[i - 1] + (3 + (6*n + 4)*x + (3*n^2 + 9*n)*x^2 + (5*n^2 + 3*n - 2)*x^3 + (2*n^2 - 1)*x^4)*deriv(v[i - 1], x))/(2 + 2*n*x + (n^2 - n)*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-b7809f2be8630f6c -
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-b7809f2be8630f6c -
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-b7809f2be8630f6c
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 euler_polynomial, shift 0
e-b7809f2be8630f6cLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
A133080 * A007318.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A007318
e-3537980ff71b1a89Geometric basis map (elementary) polytool ?
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-4d02ac33f5b2fbc9root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
-
parent_provers periodic_product
e-aa3a6b002de14e0croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-28a1cf3333f63fa4Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
-
-
premise (sequence):
A133080 * A007318.
Related sequences ?
No candidate equalities or related sequences.
References
- [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.