A114655 → θ+1
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 2 | 2 | |||||||
| 2 | 4 | 4 | 8 | ||||||
| 3 | 8 | 24 | 6 | 38 | |||||
| 4 | 16 | 96 | 72 | 8 | 192 | ||||
| 5 | 32 | 320 | 480 | 160 | 10 | 1002 | |||
| 6 | 64 | 960 | 2400 | 1600 | 300 | 12 | 5336 | ||
| 7 | 128 | 2688 | 10080 | 11200 | 4200 | 504 | 14 | 28814 | |
| 8 | 256 | 7168 | 37632 | 62720 | 39200 | 9408 | 784 | 16 | 157184 |
Computed in your browser ?
Technical details
- Node id
n-7f47b2246e50a89b· revision 1 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-c5faa49c64af63fa
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 -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 ?
- A002003: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A123164: 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 2; 2: 4, 4; 3: 8, 24, 6; 4: 16, 96, 72, 8; 5: 32, 320, 480, 160, 10; 6: 64, 960, 2400, 1600, 300, 12; 7: 128, 2688, 10080, 11200, 4200, 504, 14; 8: 256, 7168, 37632, 62720, 39200, 9408, 784, 16; 9: 512, 18432, 129024, 301056, 282240, 112896, 18816, 1152, 18; 10: 1024, 46080, 414720, 1290240, 1693440, 1016064, 282240, 34560, 1620, 20;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (2*n^2-2*n+(3*n^2-5*n+2)*x)*P(n-1,x) + ((4*n-2)*x-(2*n-1)*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.
%t MathematicaP[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 2*n + (3*n^2 - 5*n + 2)*x)*P[n - 1, x] + ((4*n - 2)*x - (2*n - 1)*x^2)*D[P[n - 1, x], x])/(n^2 - n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = ((2*n^2 - 2*n + (3*n^2 - 5*n + 2)*x)*v[i - 1] + ((4*n - 2)*x - (2*n - 1)*x^2)*deriv(v[i - 1], x))/(n^2 - n)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 1, 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-f3cda92ee6452a8a -
Coefficients of one sign. Every nonzero row, n >= 1: 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-f3cda92ee6452a8a -
Hadamard kernel (Malo). Rows P_n, n >= 1, 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-f3cda92ee6452a8a -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-f3cda92ee6452a8a
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-f3cda92ee6452a8aLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-784ea0037cdd0731root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…
Related sequences ?
Same fingerprint (1)
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
- [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.