A099097 → x ↦ x−1

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2-330
38-1790
4-2169-75270
555-245406-297810
6-144810-18092007-11072430
7377-25627206-107458964-39697290
8-9877863-2668550037-5601337449-1385121870
92584-2361193876-212215298441-267453149202-4738565610
10-676569735-317913841551-14259181604220-1198665573723-159651196830
1117711-2033051045457-31723016291751-85245207992000-51205772146176-531441590490
12-46368586548-335863811493810-2612468741418675-4674667537565343-210668857853517-17517871771470
13121393-167773210586796-40339586103391439-187813815247979530-239823477168629931-8408358928225422-57277535314410
14-3178114764459-32848398137926698-393574578806072400-12192146851379097003-1166727996729220158-32732172999930591-1860043515943230
15832040-13447685100574043-4613989061450772803-33077356805640067910-73071320577229021589-54351309423057316650-1247803785349333884-6005283347829690

Computed in your browser ?

Technical details
Node id
n-b0cf60708a253825 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A099097
Fingerprint
f6-20b7e8ee86b20d50

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:    -3,      3;
   3:     8,    -17,       9;
   4:   -21,     69,     -75,      27;
   5:    55,   -245,     406,    -297,       81;
   6:  -144,    810,   -1809,    2007,    -1107,     243;
   7:   377,  -2562,    7206,  -10745,     8964,   -3969,      729;
   8:  -987,   7863,  -26685,   50037,   -56013,   37449,   -13851,   2187;
   9:  2584, -23611,   93876, -212215,   298441, -267453,   149202, -47385,    6561;
  10: -6765,  69735, -317913,  841551, -1425918, 1604220, -1198665, 573723, -159651, 19683;
%F Formula
The row polynomials satisfy P(n,x) = -(3-3*x)*P(n-1,x) - (1-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = -3 + 3*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := -3 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(3 - 3*x)*P[n - 1, x] - (1 - 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] = -3 + 3*x; for(n = 3, N, my(i = n); v[i] = -(3 - 3*x)*v[i - 1] - (1 - 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 (5/9, 1]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-5d14c25d8e006de4
  • 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-5d14c25d8e006de4
  • 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-5d14c25d8e006de4

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