A099097 → x ↦ x−5

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2-153-12
3220-899140
4-32251965-39927-1632
547275-3848511746-15938119024
6-693000706050-28768558599-5967243-221760
710158625-124300506336210-1722329263304-214657292585024
8-148914375212703375-13018882544262885-90281131104705-750872187-30133248

Computed in your browser ?

Technical details
Node id
n-936b9851d7f61099 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A099097
Fingerprint
f6-14f92c27ff4cd655

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:          -15,           3;
   3:          220,         -89,            9;
   4:        -3225,        1965,         -399,          27;
   5:        47275,      -38485,        11746,       -1593,          81;
   6:      -693000,      706050,      -287685,       58599,       -5967,        243;
   7:     10158625,   -12430050,      6336210,    -1722329,      263304,     -21465,        729;
   8:   -148914375,   212703375,   -130188825,    44262885,    -9028113,    1104705,     -75087,     2187;
   9:   2182922500, -3564984875,   2546831400, -1039561895,   265171501,  -43284285,    4415310,  -257337,    6561;
  10: -31999265625, 58811109375, -48033778125, 22882419375, -7006854750, 1430227140, -194602365, 17019963, -868239, 19683;
%F Formula
The row polynomials satisfy P(n,x) = -(15-3*x)*P(n-1,x) - (5-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = -15 + 3*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := -15 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(15 - 3*x)*P[n - 1, x] - (5 - 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] = -15 + 3*x; for(n = 3, N, my(i = n); v[i] = -(15 - 3*x)*v[i - 1] - (5 - 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 (41/9, 5]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-4899b779b1a74e41
  • 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-4899b779b1a74e41
  • 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-4899b779b1a74e41

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