A152198 → θ+1
nonnegative coefficients only rational roots
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 | 1 | 1 | |||||||
| 2 | 1 | 2 | 3 | ||||||
| 3 | 1 | 2 | 3 | ||||||
| 4 | 1 | 4 | 3 | 8 | |||||
| 5 | 1 | 4 | 3 | 8 | |||||
| 6 | 1 | 6 | 9 | 4 | 20 | ||||
| 7 | 1 | 6 | 9 | 4 | 20 | ||||
| 8 | 1 | 8 | 18 | 16 | 5 | 48 | |||
| 9 | 1 | 8 | 18 | 16 | 5 | 48 | |||
| 10 | 1 | 10 | 30 | 40 | 25 | 6 | 112 | ||
| 11 | 1 | 10 | 30 | 40 | 25 | 6 | 112 | ||
| 12 | 1 | 12 | 45 | 80 | 75 | 36 | 7 | 256 | |
| 13 | 1 | 12 | 45 | 80 | 75 | 36 | 7 | 256 | |
| 14 | 1 | 14 | 63 | 140 | 175 | 126 | 49 | 8 | 576 |
Computed in your browser ?
Technical details
- Node id
n-b6f36b24716e535e· revision 1 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-b1032d52426bb000
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 ℚ): yes
OEIS matches ?
- A336102: 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: 1, 2; 3: 1, 2; 4: 1, 4, 3; 5: 1, 4, 3; 6: 1, 6, 9, 4; 7: 1, 6, 9, 4; 8: 1, 8, 18, 16, 5; 9: 1, 8, 18, 16, 5;
%F FormulaThe row polynomials satisfy (8+(4*n+6)*x+(n^2+n)*x^2)*P(n,x) = (8+(20*n-10)*x+(9*n^2+5*n-12)*x^2+(n^3+2*n^2-n-2)*x^3)*P(n-1,x) - (16*x+(12*n+32)*x^2+(2*n^2+18*n+20)*x^3+(2*n^2+6*n+4)*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[((8 + (20*n - 10)*x + (9*n^2 + 5*n - 12)*x^2 + (n^3 + 2*n^2 - n - 2)*x^3)*P[n - 1, x] - (16*x + (12*n + 32)*x^2 + (2*n^2 + 18*n + 20)*x^3 + (2*n^2 + 6*n + 4)*x^4)*D[P[n - 1, x], x])/(8 + (4*n + 6)*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] = ((8 + (20*n - 10)*x + (9*n^2 + 5*n - 12)*x^2 + (n^3 + 2*n^2 - n - 2)*x^3)*v[i - 1] - (16*x + (12*n + 32)*x^2 + (2*n^2 + 18*n + 20)*x^3 + (2*n^2 + 6*n + 4)*x^4)*deriv(v[i - 1], x))/(8 + (4*n + 6)*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-62712304e6278432 -
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-62712304e6278432 -
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-62712304e6278432
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-62712304e6278432Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle read by rows, A007318 rows repeated.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-3ca43d0d97d5e532Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: triangle of repeated stepped binomial coefficients.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-35a33ce2a6b89415root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows: triangle of repeated stepped binomial coefficients.
-
gamma_polynomial scale 1, shift 0
e-78c582ff5f7b6a70Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-6e3ca670df3d0a74root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-b2e3690a28625635Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
-
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
-
parent_provers periodic_product
e-b274e5cc6dbb8c2droot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, A007318 rows repeated.
Related sequences ?
Same fingerprint (3)
Equal up to content, sign, reversal and a small index shift.
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.