A063967 → x ↦ x−9

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_{1}(x) = 1\)
\(P_{2}(x) = -8 + x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2-81-7
356-15142
4-384160-221-245
52624-1488313-2911421
6-1792012864-3656515-361-8232
7122368-10630438120-7231766-43147677
8-835584851968-36915288192-125561066-501-276115
95705728-66785283393920-978720175281-199741415-5711599066
10-3896115251482624-3002470410148992-2192328313989-298281813-641-9260657
11266043392-391688192257850368-9999296025306648-4369167521319-424612260-71153631137
12-18166579202948726784-2162810880946577408-27475852855555744-7987106816675-582162756-781-310593360
1312404916224-2200692326417796722688-86776360962842199488-658944496110912873-136594991221862-774363301-8511798735561
14-84706066432163053830144-14412949094477482381312-282705863687394550976-1426794888205668359-221519921761086-1004643895-921-10416995407
15578409201664-12006764052481151709052928-676770729984272231840256-7931323872017262662600-2851952895359449900-343993302460954-1276434538-99160327818922

Computed in your browser ?

Technical details
Node id
n-29ef532ce8637fba · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A063967
Fingerprint
f6-185ebee0b00e059f

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:         1;
   2:        -8,        1;
   3:        56,      -15,         1;
   4:      -384,      160,       -22,        1;
   5:      2624,    -1488,       313,      -29,        1;
   6:    -17920,    12864,     -3656,      515,      -36,      1;
   7:    122368,  -106304,     38120,    -7231,      766,    -43,      1;
   8:   -835584,   851968,   -369152,    88192,   -12556,   1066,    -50,    1;
   9:   5705728, -6678528,   3393920,  -978720,   175281, -19974,   1415,  -57,   1;
  10: -38961152, 51482624, -30024704, 10148992, -2192328, 313989, -29828, 1813, -64, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(8-x)*P(n-1,x) - (8-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = -8 + x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := -8 + 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, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = -8 + x; for(n = 3, N, my(i = n); 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, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-61f403043a781326
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-61f403043a781326
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-61f403043a781326

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