A069466 → γ
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 | 2 | 2 | |||||||
| 2 | 6 | 12 | 18 | ||||||
| 3 | 20 | 120 | 140 | ||||||
| 4 | 70 | 840 | 420 | 1330 | |||||
| 5 | 252 | 5040 | 7560 | 12852 | |||||
| 6 | 924 | 27720 | 83160 | 18480 | 130284 | ||||
| 7 | 3432 | 144144 | 720720 | 480480 | 1348776 | ||||
| 8 | 12870 | 720720 | 5405400 | 7207200 | 900900 | 14247090 | |||
| 9 | 48620 | 3500640 | 36756720 | 81681600 | 30630600 | 152618180 | |||
| 10 | 184756 | 16628040 | 232792560 | 775975200 | 581981400 | 46558512 | 1654120468 | ||
| 11 | 705432 | 77597520 | 1396755360 | 6518191680 | 8147739600 | 1955457504 | 18096447096 | ||
| 12 | 2704156 | 356948592 | 8031343320 | 49972802880 | 93699005400 | 44975522592 | 2498640144 | 199536967084 | |
| 13 | 10400600 | 1622493600 | 44618574000 | 356948592000 | 936990054000 | 749592043200 | 124932007200 | 2214714164600 | |
| 14 | 40116600 | 7301221200 | 240940299600 | 2409402996000 | 8432910486000 | 10119492583200 | 3373164194400 | 137680171200 | 24720932068200 |
Generated b-files: A216584 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-ce7f61ca1eb91390· revision 1 · JSON- Definition source
derived:gamma_polynomial- Fingerprint
f6-d272e4b2958d4a94
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 ?
- A216584: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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, 12; 3: 20, 120; 4: 70, 840, 420; 5: 252, 5040, 7560; 6: 924, 27720, 83160, 18480; 7: 3432, 144144, 720720, 480480; 8: 12870, 720720, 5405400, 7207200, 900900; 9: 48620, 3500640, 36756720, 81681600, 30630600;
%F FormulaThe row polynomials satisfy n^2*P(n,x) = (8*n^2-8*n+2)*P(n-1,x) - (16*n^2-32*n+12-(64*n^2-128*n+48)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((8*n^2 - 8*n + 2)*P[n - 1, x] - (16*n^2 - 32*n + 12 - (64*n^2 - 128*n + 48)*x)*P[n - 2, x])/(n^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((8*n^2 - 8*n + 2)*v[i - 1] - (16*n^2 - 32*n + 12 - (64*n^2 - 128*n + 48)*x)*v[i - 2])/(n^2)); 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-510754e51c3ada00 -
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-510754e51c3ada00 -
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-510754e51c3ada00
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
-
gamma_polynomial scale 1, shift 0
e-510754e51c3ada00Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k …
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-7dc194e46d1f26feroot: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
-
premise (sequence):
Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k …
Related sequences ?
Same fingerprint (2)
Equal up to content, sign, reversal and a small index shift.
- A391403: Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= fl…
- A089627: T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023