A113214 → x ↦ x−8

Proved for all n: all roots real, in (4, 8] · alternating coefficient signs · interlacing (weak) what this means

Recurrence
\(P_{n}(x) = \left(-8 + x\right)\,P_{n-1}(x) + \left(-8 + x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = -6 + x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-61-5
240-13128
3-272130-201-161
41856-1168269-271931
5-126729888-3030457-341-5390
686528-8057630808-6201694-41131213
7-590848639360-29291273730-11024980-481-180761
84034560-49745922655616-802336150169-178421315-5511046836
9-2754969638125568-232368648191552-1841766274041-269981699-621-6062525
10188121088-288722944197800960-7969497620921992-3741189461663-388352132-69135109823
11-12845711362165350400-1647110144746591488-22414523246817410-6944468731753-536962614-761-203331086
128771600384-1610946969613471100928-67844812802292682432-54783300894938661-120261491105430-719243145-8311177548841
13-59896233984119039983616-10853604556860127109120-225861873926076661984-1204969142178349361-197082681606214-938623725-901-6819524285
14408997068800-874568744960863450071040-521805967360215690667520-6452413676814409072824-2440616177315145916-308771582260026-1198534354-97139493828108

Computed in your browser ?

Technical details
Node id
n-e58c4cf54cd7c009 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A113214
Fingerprint
f6-896ccc203557ab88

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 0)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): no
  • 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 Example
Triangle begins:
  0:         1;
  1:        -6,        1;
  2:        40,      -13,         1;
  3:      -272,      130,       -20,       1;
  4:      1856,    -1168,       269,     -27,        1;
  5:    -12672,     9888,     -3030,     457,      -34,      1;
  6:     86528,   -80576,     30808,   -6201,      694,    -41,      1;
  7:   -590848,   639360,   -292912,   73730,   -11024,    980,    -48,    1;
  8:   4034560, -4974592,   2655616, -802336,   150169, -17842,   1315,  -55,   1;
  9: -27549696, 38125568, -23236864, 8191552, -1841766, 274041, -26998, 1699, -62, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(8-x)*P(n-1,x) - (8-x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -6 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := -6 + x;
P[n_, x_] := P[n, x] = Expand[-(8 - x)*P[n - 1, x] - (8 - x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = -6 + x; for(n = 2, N, my(i = n + 1); v[i] = -(8 - x)*v[i - 1] - (8 - x)*v[i - 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 (4, 8]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-fbfad365d270ad64
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n(-x) 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-fbfad365d270ad64
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-fbfad365d270ad64

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

Used in 1 proof step

No candidate equalities or related sequences.

References

  1. [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