A030528 → x ↦ x−7

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-61-5
235-12124
3-203106-181-114
41176-826213-241540
5-68116013-2085356-301-2556
639445-4194418291-4196535-36112096
7-228438284151-14937343086-7375750-421-57240
81322951-18844421159781-40331286770-118381001-481270864
9-766159112296550-86731473531990-915991157011-178011288-541-1281744
1044370480-7922339663005670-294141128933225-1845432262773-254801611-6016065280
11-256962223505196811-447254507235507377-8200276019836181-3403225414316-350911970-661-28701216
121488142201-31944056483115715274-1826901692717580010-19900477839973913-5862304623196-468502365-721135815616
13-861825984620055641837-2136843420613808220972-60404350651889757429-43516341374706604-9564723902265-609732796-781-642686400
1449910823515-125158770968144630268713-10212195389249241304665-171581236124457079151-877099600131434989-149294321265671-776763263-8413041224704

Computed in your browser ?

Technical details
Node id
n-cc7e0c23bafd90c3 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A030528
Fingerprint
f6-4c9fef36566d861c

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,        1;
  2:       35,      -12,        1;
  3:     -203,      106,      -18,       1;
  4:     1176,     -826,      213,     -24,       1;
  5:    -6811,     6013,    -2085,     356,     -30,      1;
  6:    39445,   -41944,    18291,   -4196,     535,    -36,      1;
  7:  -228438,   284151,  -149373,   43086,   -7375,    750,    -42,    1;
  8:  1322951, -1884442,  1159781, -403312,   86770, -11838,   1001,  -48,   1;
  9: -7661591, 12296550, -8673147, 3531990, -915991, 157011, -17801, 1288, -54, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(7-x)*P(n-1,x) - (7-x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -6 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := -6 + x;
P[n_, x_] := P[n, x] = Expand[-(7 - x)*P[n - 1, x] - (7 - 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 + x; for(n = 2, N, my(i = n + 1); v[i] = -(7 - x)*v[i - 1] - (7 - 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 (3, 7]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-742e5241e9a4e627
  • 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-742e5241e9a4e627
  • 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-742e5241e9a4e627

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