Stirling2 triangle with scaled diagonals (powers of 4).
A075499 (tail) nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · Hadamard kernel basis map preserves real roots what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 16 | 12 | 1 | 29 | |||||||
| 1 | 64 | 112 | 24 | 1 | 201 | ||||||
| 2 | 256 | 960 | 400 | 40 | 1 | 1657 | |||||
| 3 | 1024 | 7936 | 5760 | 1040 | 60 | 1 | 15821 | ||||
| 4 | 4096 | 64512 | 77056 | 22400 | 2240 | 84 | 1 | 170389 | |||
| 5 | 16384 | 520192 | 989184 | 435456 | 67200 | 4256 | 112 | 1 | 2032785 | ||
| 6 | 65536 | 4177920 | 12390400 | 7956480 | 1779456 | 169344 | 7392 | 144 | 1 | 26546673 | |
| 7 | 262144 | 33488896 | 152862720 | 139694080 | 43545600 | 5843712 | 376320 | 12000 | 180 | 1 | 376085653 |
Computed in your browser ?
Technical details
- Node id
n-b17a463cc18bc314· revision 1 · JSON- Definition source
oeis_catalog:A075499- Fingerprint
f6-6d39ca603c4714ce
Observed on the stored rows ?
- Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
- 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 ?
- A004213: 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: 16, 12, 1; 1: 64, 112, 24, 1; 2: 256, 960, 400, 40, 1; 3: 1024, 7936, 5760, 1040, 60, 1; 4: 4096, 64512, 77056, 22400, 2240, 84, 1; 5: 16384, 520192, 989184, 435456, 67200, 4256, 112, 1; 6: 65536, 4177920, 12390400, 7956480, 1779456, 169344, 7392, 144, 1; 7: 262144, 33488896, 152862720, 139694080, 43545600, 5843712, 376320, 12000, 180, 1; 8: 1048576, 268173312, 1867841536, 2387968000, 1010606080, 183794688, 16380672, 760320, 18480, 220, 1; 9: 4194304, 2146435072, 22682271744, 40075329536, 22600089600, 5421678592, 642453504, 40710912, 1425600, 27280, 264, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (4+x)*P(n-1,x) + 4*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 16 + 12*x + x^2.
%t MathematicaP[0, x_] := 16 + 12*x + x^2;
P[n_, x_] := P[n, x] = Expand[(4 + x)*P[n - 1, x] + 4*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 16 + 12*x + x^2; for(n = 1, N, my(i = n + 1); v[i] = (4 + x)*v[i - 1] + 4*x*deriv(v[i - 1], x)); 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-6592d91fe2aba204 -
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-6592d91fe2aba204 -
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-6592d91fe2aba204 -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-6592d91fe2aba204 -
Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 4] to roots in (-inf, 0]: source (-inf, a + b h + kappa m] = (-inf, 4] with m = 0, target (-inf, 0]
The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.by the cited steps:
e-ce9657deb3567cce
Proof chains
2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
basis_map_theorem
e-ce9657deb3567cceroot: theorem checkRay basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
theorem_check liu_wang
e-6592d91fe2aba204root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
Used in 2 proof steps
e-4d98a7f5f8c29383obreschkoff_combination → obreschkoff_combination of Stirling2 triangle with scaled diagonals (powers of 4).e-4d98a7f5f8c29383obreschkoff_combination → obreschkoff_combination of Stirling2 triangle with scaled diagonals (powers of 4).
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741