A113953 → x ↦ x−1

Proved for all n: all roots real, in (−7, 1] · interlacing (weak) what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-110
2-1010
33-5110
4-16-8210
5-592-10310
67-2835-8-11410
737-4967-23-11510
8-1766-70-3096-42-10610
911-91248-27254114-64-8710
1023-64-67440-578216114-88-5810
11-45291-675533366-91445890-113-1910
12-1-162972-22222203-308-116877237-13841010
1391-511798778-40915071-1884-12041141-49-162101110
14-89924-35776408-3981-41408675-4560-8751540-171-184171210

Computed in your browser ?

Technical details
Node id
n-86ae49c0879d58f0 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A113953
Fingerprint
f6-045939b799da74a9

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:  -1,   1;
  2:  -1,   0,   1;
  3:   3,  -5,   1,    1;
  4:  -1,   6,  -8,    2,   1;
  5:  -5,   9,   2,  -10,   3,   1;
  6:   7, -28,  35,   -8, -11,   4,   1;
  7:   3,   7, -49,   67, -23, -11,   5,  1;
  8: -17,  66, -70,  -30,  96, -42, -10,  6, 1;
  9:  11, -91, 248, -272,  54, 114, -64, -8, 7, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(1-x)*P(n-1,x) - (2-2*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := -1 + x;
P[n_, x_] := P[n, x] = Expand[-(1 - x)*P[n - 1, x] - (2 - 2*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] = -1 + x; for(n = 2, N, my(i = n + 1); v[i] = -(1 - x)*v[i - 1] - (2 - 2*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 (-7, 1]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-38de1ebb8f2e73b6
  • 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-38de1ebb8f2e73b6

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