A099040 → x ↦ x−3

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-62-4
230-22412
3-144168-648-32
4684-1104652-1681680
5-32406696-54002136-41632-192
615336-3866439672-213046336-99264448
7-72576216000-269568183552-7385617600-2304128-1024
8343440-11784961734048-1433280729616-23468846656-52482562304
9-16251846316704-1071187210427328-64340162614048-700288119424-11776512-5120
107690464-3339273664143360-7191993652214496-256849608680512-1992320297472-26112102411264
11-36391680174586752-374740992475818624-397668096229986432-9402316827197824-5459968724992-573442048-24576
12172207296-9045665282145973824-30445873922880518976-1916716032920658880-32191833681385984-145182721735680-124928409653248
13-8148936964651509888-1208735654418955078272-2003464281615086079360-83332734723421594496-1044997120234611712-376565764093952-2703368192-114688
143856118400-2376703296067142183040-115345710720134745724800-11332442764870814414208-3342328614411981019136-3247782912655712256-956559369535488-58163216384245760

Computed in your browser ?

Technical details
Node id
n-b59b1769d0dc40fc · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A099040
Fingerprint
f6-d773d6147703cd7e

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,        2;
  2:       30,      -22,         4;
  3:     -144,      168,       -64,        8;
  4:      684,    -1104,       652,     -168,       16;
  5:    -3240,     6696,     -5400,     2136,     -416,      32;
  6:    15336,   -38664,     39672,   -21304,     6336,    -992,      64;
  7:   -72576,   216000,   -269568,   183552,   -73856,   17600,   -2304,    128;
  8:   343440, -1178496,   1734048, -1433280,   729616, -234688,   46656,  -5248,    256;
  9: -1625184,  6316704, -10711872, 10427328, -6434016, 2614048, -700288, 119424, -11776, 512;
%F Formula
The row polynomials satisfy P(n,x) = -(6-2*x)*P(n-1,x) - (6-2*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -6 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := -6 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(6 - 2*x)*P[n - 1, x] - (6 - 2*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 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(6 - 2*x)*v[i - 1] - (6 - 2*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 (1, 3]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-319b2a76ea6c1ab0
  • 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-319b2a76ea6c1ab0
  • 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-319b2a76ea6c1ab0

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