A103633 → (θ+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 | 0 | 4 | 4 | ||||||
| 2 | 0 | 4 | 9 | 13 | |||||
| 3 | 0 | 0 | 9 | 16 | 25 | ||||
| 4 | 0 | 0 | 9 | 32 | 25 | 66 | |||
| 5 | 0 | 0 | 0 | 16 | 50 | 36 | 102 | ||
| 6 | 0 | 0 | 0 | 16 | 75 | 108 | 49 | 248 | |
| 7 | 0 | 0 | 0 | 0 | 25 | 108 | 147 | 64 | 344 |
Computed in your browser ?
Technical details
- Node id
n-2c235d997a804fe6· revision 1 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-fd66d757952530e2
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: 0, 4; 2: 0, 4, 9; 3: 0, 0, 9, 16; 4: 0, 0, 9, 32, 25; 5: 0, 0, 0, 16, 50, 36; 6: 0, 0, 0, 16, 75, 108, 49; 7: 0, 0, 0, 0, 25, 108, 147, 64; 8: 0, 0, 0, 0, 25, 144, 294, 256, 81; 9: 0, 0, 0, 0, 0, 36, 196, 384, 324, 100;
%F FormulaThe row polynomials satisfy (n^4+6*n^3+13*n^2+12*n+4+(8*n^4+32*n^3+22*n^2-10*n-4)*x+(24*n^4+48*n^3-28*n^2-72*n+16)*x^2+(32*n^4-56*n^2)*x^3+(16*n^4-32*n^3+16*n^2)*x^4)*P(n,x) = -(n^5+5*n^4+7*n^3-n^2-8*n-4+(10*n^5+45*n^4+38*n^3-71*n^2-122*n-44)*x+(40*n^5+144*n^4-8*n^3-402*n^2-178*n+212)*x^2+(80*n^5+184*n^4-296*n^3-536*n^2+444*n+172)*x^3+(80*n^5+48*n^4-384*n^3+120*n^2+200*n+32)*x^4+(32*n^5-48*n^4-32*n^3+64*n^2+16*n-32)*x^5)*P(n-1,x) + ((2*n^4+12*n^3+26*n^2+24*n+8)*x+(18*n^4+92*n^3+134*n^2+20*n-56)*x^2+(64*n^4+256*n^3+180*n^2-196*n-96)*x^3+(112*n^4+304*n^3-40*n^2-256*n-24)*x^4+(96*n^4+128*n^3-144*n^2-64*n+24)*x^5+(32*n^4-32*n^2+16)*x^6)*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[(-(n^5 + 5*n^4 + 7*n^3 - n^2 - 8*n - 4 + (10*n^5 + 45*n^4 + 38*n^3 - 71*n^2 - 122*n - 44)*x + (40*n^5 + 144*n^4 - 8*n^3 - 402*n^2 - 178*n + 212)*x^2 + (80*n^5 + 184*n^4 - 296*n^3 - 536*n^2 + 444*n + 172)*x^3 + (80*n^5 + 48*n^4 - 384*n^3 + 120*n^2 + 200*n + 32)*x^4 + (32*n^5 - 48*n^4 - 32*n^3 + 64*n^2 + 16*n - 32)*x^5)*P[n - 1, x] + ((2*n^4 + 12*n^3 + 26*n^2 + 24*n + 8)*x + (18*n^4 + 92*n^3 + 134*n^2 + 20*n - 56)*x^2 + (64*n^4 + 256*n^3 + 180*n^2 - 196*n - 96)*x^3 + (112*n^4 + 304*n^3 - 40*n^2 - 256*n - 24)*x^4 + (96*n^4 + 128*n^3 - 144*n^2 - 64*n + 24)*x^5 + (32*n^4 - 32*n^2 + 16)*x^6)*D[P[n - 1, x], x])/(n^4 + 6*n^3 + 13*n^2 + 12*n + 4 + (8*n^4 + 32*n^3 + 22*n^2 - 10*n - 4)*x + (24*n^4 + 48*n^3 - 28*n^2 - 72*n + 16)*x^2 + (32*n^4 - 56*n^2)*x^3 + (16*n^4 - 32*n^3 + 16*n^2)*x^4)]];
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] = (-(n^5 + 5*n^4 + 7*n^3 - n^2 - 8*n - 4 + (10*n^5 + 45*n^4 + 38*n^3 - 71*n^2 - 122*n - 44)*x + (40*n^5 + 144*n^4 - 8*n^3 - 402*n^2 - 178*n + 212)*x^2 + (80*n^5 + 184*n^4 - 296*n^3 - 536*n^2 + 444*n + 172)*x^3 + (80*n^5 + 48*n^4 - 384*n^3 + 120*n^2 + 200*n + 32)*x^4 + (32*n^5 - 48*n^4 - 32*n^3 + 64*n^2 + 16*n - 32)*x^5)*v[i - 1] + ((2*n^4 + 12*n^3 + 26*n^2 + 24*n + 8)*x + (18*n^4 + 92*n^3 + 134*n^2 + 20*n - 56)*x^2 + (64*n^4 + 256*n^3 + 180*n^2 - 196*n - 96)*x^3 + (112*n^4 + 304*n^3 - 40*n^2 - 256*n - 24)*x^4 + (96*n^4 + 128*n^3 - 144*n^2 - 64*n + 24)*x^5 + (32*n^4 - 32*n^2 + 16)*x^6)*deriv(v[i - 1], x))/(n^4 + 6*n^3 + 13*n^2 + 12*n + 4 + (8*n^4 + 32*n^3 + 22*n^2 - 10*n - 4)*x + (24*n^4 + 48*n^3 - 28*n^2 - 72*n + 16)*x^2 + (32*n^4 - 56*n^2)*x^3 + (16*n^4 - 32*n^3 + 16*n^2)*x^4)); 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-71ab500f4221c0be -
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-71ab500f4221c0be -
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-71ab500f4221c0be
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-71ab500f4221c0beLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] 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.
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.