A099097 → x ↦ x−6

Proved for all n: all roots real, in (50/9, 6] · alternating coefficient signs · interlacing (weak) what this means

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2-183-15
3318-1079220
4-56162844-48027-3225
599180-6708017011-19178147275
6-17515441482300-50171484897-7182243-693000
730932712-3143437213308606-3004775381564-2583972910158625
8-546279552647971488-32936544093000672-157544881601154-903962187-148914375

Computed in your browser ?

Technical details
Node id
n-f92327b2555fefca · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A099097
Fingerprint
f6-bdddce713470c1d7

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:           -18,            3;
   3:           318,         -107,             9;
   4:         -5616,         2844,          -480,          27;
   5:         99180,       -67080,         17011,       -1917,           81;
   6:      -1751544,      1482300,       -501714,       84897,        -7182,        243;
   7:      30932712,    -31434372,      13308606,    -3004775,       381564,     -25839,        729;
   8:    -546279552,    647971488,    -329365440,    93000672,    -15754488,    1601154,     -90396,     2187;
   9:    9647435664, -13082786496,    7761206376, -2630771160,    557288641,  -75547638,    6400377,  -309825,     6561;
  10: -170376164640, 259998355440, -176325910128, 69750130536, -17735981418, 3006361995, -339706170, 24674463, -1045386, 19683;
%F Formula
The row polynomials satisfy P(n,x) = -(18-3*x)*P(n-1,x) - (6-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = -18 + 3*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := -18 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(18 - 3*x)*P[n - 1, x] - (6 - 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] = -18 + 3*x; for(n = 3, N, my(i = n); v[i] = -(18 - 3*x)*v[i - 1] - (6 - 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 (50/9, 6]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-b062da8ba0c30336
  • 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-b062da8ba0c30336
  • 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-b062da8ba0c30336

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