A063967 → x ↦ x−12

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2-111-10
3110-21190
4-1089319-311-800
510769-4257628-4117100
6-10648052998-105051037-511-63000
71052821-631862157388-208331546-611559000
8-104097517313845-2194577364639-362412155-711-4960000
9102926230-8285874329091062-5819055725451-577292864-81144010000
10-1017681269923510357-37140623386895061-130357261300524-862973673-911-390500000
1110062305429-101619227934606118495-1234151237216489031-259810202160558-1229454582-10113464900000
12-99490865760110667160956-5582024731816854530198-3385242531474938761-474973673386253-1686735591-1111-30744000000
13983714163641-1194986180124663860655216-22303829739450476667461-8107288651947662640-812331975068309-2244816700-1211272791000000
14-972645627669112811732508729-77727635060462876061847054-724189441426131047273720-175341678931756481657-1317429407307426-2913697909-1311-2420470000000
1596170163243550-13652695172770589814677687735-3629216189709010063864063275-2026052609724305391542852-350142383133068669401-20458702610214304-3703379218-141121476790000000

Computed in your browser ?

Technical details
Node id
n-383c73dff2796e24 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A063967
Fingerprint
f6-b02960c001dcda1c

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:         -11,         1;
   3:         110,       -21,          1;
   4:       -1089,       319,        -31,        1;
   5:       10769,     -4257,        628,      -41,         1;
   6:     -106480,     52998,     -10505,     1037,       -51,       1;
   7:     1052821,   -631862,     157388,   -20833,      1546,     -61,      1;
   8:   -10409751,   7313845,   -2194577,   364639,    -36241,    2155,    -71,    1;
   9:   102926230, -82858743,   29091062, -5819055,    725451,  -57729,   2864,  -81,   1;
  10: -1017681269, 923510357, -371406233, 86895061, -13035726, 1300524, -86297, 3673, -91, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(11-x)*P(n-1,x) - (11-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = -11 + x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := -11 + x;
P[n_, x_] := P[n, x] = Expand[-(11 - x)*P[n - 1, x] - (11 - 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] = -11 + x; for(n = 3, N, my(i = n); v[i] = -(11 - x)*v[i - 1] - (11 - 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 (7, 11]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-4d81c1e2745a9ed0
  • 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-4d81c1e2745a9ed0
  • 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-4d81c1e2745a9ed0

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