A008292 → γ (scale 1/4) (shift +1) → x ↦ x+1
nonnegative coefficients
Proved for all n: all roots real, in (−∞, −1] · 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 | 2 | 2 | |||||||
| 2 | 6 | 2 | 8 | ||||||
| 3 | 24 | 16 | 40 | ||||||
| 4 | 120 | 120 | 16 | 256 | |||||
| 5 | 720 | 960 | 272 | 1952 | |||||
| 6 | 5040 | 8400 | 3696 | 272 | 17408 | ||||
| 7 | 40320 | 80640 | 48384 | 7936 | 177280 | ||||
| 8 | 362880 | 846720 | 645120 | 168960 | 7936 | 2031616 | |||
| 9 | 3628800 | 9676800 | 8951040 | 3256320 | 353792 | 25866752 | |||
| 10 | 39916800 | 119750400 | 130394880 | 61036800 | 10830336 | 353792 | 362283008 | ||
| 11 | 479001600 | 1596672000 | 2001162240 | 1148590080 | 287468544 | 22368256 | 5535262720 | ||
| 12 | 6227020800 | 22832409600 | 32380508160 | 22048266240 | 7180293120 | 929510400 | 22368256 | 91620376576 | |
| 13 | 87178291200 | 348713164800 | 552129177600 | 435430195200 | 175371356160 | 32439214080 | 1903757312 | 1633165156352 | |
| 14 | 1307674368000 | 5666588928000 | 9909265766400 | 8888034355200 | 4275610859520 | 1039052851200 | 103028914176 | 1903757312 | 31191159799808 |
Computed in your browser ?
Technical details
- Node id
n-3058adfe9873c66a· revision 1 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-446c1dd59a8c435a
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 ?
- A000828: 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: 2; 2: 6, 2; 3: 24, 16; 4: 120, 120, 16; 5: 720, 960, 272; 6: 5040, 8400, 3696, 272; 7: 40320, 80640, 48384, 7936; 8: 362880, 846720, 645120, 168960, 7936; 9: 3628800, 9676800, 8951040, 3256320, 353792;
%F FormulaThe row polynomials satisfy P(n,x) = (n+1+(n-1)*x)*P(n-1,x) - (2*x+2*x^2)*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[(n + 1 + (n - 1)*x)*P[n - 1, x] - (2*x + 2*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; for(n = 1, N, my(i = n + 1); v[i] = (n + 1 + (n - 1)*x)*v[i - 1] - (2*x + 2*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, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-8621fad14db1f00c -
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-8621fad14db1f00c -
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-8621fad14db1f00c
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 affine, shift 0
e-8621fad14db1f00cAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) (n >= 1, 0 <= k <= ceiling(n/2)-1) = number of permutations of [n] with k peaks.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
gamma_polynomial scale 1/4, shift 1
e-00ceaf3777abe095Gamma 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 read by rows: T(n,k) (n >= 1, 0 <= k <= ceiling(n/2)-1) = number of permutations of [n] with k peaks.
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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