A008292 → γ (shift +1) → θ+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 | 1 | 1 | |||||||
| 2 | 1 | 4 | 5 | ||||||
| 3 | 1 | 16 | 17 | ||||||
| 4 | 1 | 44 | 48 | 93 | |||||
| 5 | 1 | 104 | 408 | 513 | |||||
| 6 | 1 | 228 | 2160 | 1088 | 3477 | ||||
| 7 | 1 | 480 | 9216 | 15872 | 25569 | ||||
| 8 | 1 | 988 | 34848 | 137216 | 39680 | 212733 | |||
| 9 | 1 | 2008 | 122328 | 920576 | 884480 | 1929393 | |||
| 10 | 1 | 4052 | 409152 | 5313344 | 11326720 | 2122752 | 19176021 | ||
| 11 | 1 | 8144 | 1324704 | 27799808 | 109767040 | 67104768 | 206004465 | ||
| 12 | 1 | 16332 | 4194000 | 135927040 | 896332800 | 1192951296 | 156577792 | 2385999261 | |
| 13 | 1 | 32712 | 13071960 | 633180160 | 6520569600 | 15762502656 | 6663150592 | 29592507681 | |
| 14 | 1 | 65476 | 40295376 | 2846447680 | 43683500800 | 172821851136 | 156979572736 | 15230058496 | 391601791701 |
Computed in your browser ?
Technical details
- Node id
n-11b932db1f730a1c· revision 1 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-a78503eefaeb1d43
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 ℚ): 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: 1; 2: 1, 4; 3: 1, 16; 4: 1, 44, 48; 5: 1, 104, 408; 6: 1, 228, 2160, 1088; 7: 1, 480, 9216, 15872; 8: 1, 988, 34848, 137216, 39680; 9: 1, 2008, 122328, 920576, 884480;
%F FormulaThe row polynomials satisfy P(n,x) = -(4*n^2-4*n-8)*x^2*P(n-2,x) - ((2*n+2)*x^2-(8*n+8)*x^3)*d/dx P(n-2,x) + (1+(4*n-4)*x)*P(n-1,x) + (x-4*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 4*n - 8)*x^2*P[n - 2, x] - ((2*n + 2)*x^2 - (8*n + 8)*x^3)*D[P[n - 2, x], x] + (1 + (4*n - 4)*x)*P[n - 1, x] + (x - 4*x^2)*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] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = -(4*n^2 - 4*n - 8)*x^2*v[i - 2] - ((2*n + 2)*x^2 - (8*n + 8)*x^3)*deriv(v[i - 2], x) + (1 + (4*n - 4)*x)*v[i - 1] + (x - 4*x^2)*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-f727bc245399bdee -
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-f727bc245399bdee -
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-f727bc245399bdee
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-f727bc245399bdeeLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
gamma_polynomial scale 1, shift 1
e-e49ea542bfed6bbfGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
eulerian
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-ab3cdcfae289b48droot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers root_domain
e-6c46c948823f0a8croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-c61ecf4ef1c45372Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
eulerian
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
eulerian
-
-
premise (sequence):
eulerian
-
-
premise (sequence):
Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1).
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
- [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.