A113953 → x ↦ x−10

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-101-9
280-18163
3-600220-261-405
44400-2280424-3412511
5-3200021600-5560692-421-15309
6232000-19360064160-109521024-50192583
7-16800001672000-680800148720-189681420-581-557685
812160000-140640006809600-1820640296016-301201880-6613352671
9-88000000116000000-6520000020680000-4104000530880-449202404-741-20135709
10636800000-942400000603680000-22196800052158400-8218368882240-638802992-821120873303
11-46080000007564800000-54432000002279360000-620112000115516480-150806081383120-875123644-901-725416965
1233344000000-6013440000048038400000-225900800006993376000-1506592640232241024-258697282070640-1163284360-9814353033231
13-241280000000474176000000-416524800000217465600000-7556288000018508748800-3296357760433114688-420596482986016-1508405140-1061-26119793709
141745920000000-37136640000003558387200000-2043302400000788046720000-21653176320043814320640-6645628032760558912-654519684174560-1915605984-1141156723545223

Computed in your browser ?

Technical details
Node id
n-f5c69f2b67904644 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A113953
Fingerprint
f6-b469fe3780d6c71d

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:       -10,         1;
  2:        80,       -18,         1;
  3:      -600,       220,       -26,        1;
  4:      4400,     -2280,       424,      -34,        1;
  5:    -32000,     21600,     -5560,      692,      -42,      1;
  6:    232000,   -193600,     64160,   -10952,     1024,    -50,      1;
  7:  -1680000,   1672000,   -680800,   148720,   -18968,   1420,    -58,    1;
  8:  12160000, -14064000,   6809600, -1820640,   296016, -30120,   1880,  -66,   1;
  9: -88000000, 116000000, -65200000, 20680000, -4104000, 530880, -44920, 2404, -74, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(10-x)*P(n-1,x) - (20-2*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -10 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := -10 + x;
P[n_, x_] := P[n, x] = Expand[-(10 - x)*P[n - 1, x] - (20 - 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] = -10 + x; for(n = 2, N, my(i = n + 1); v[i] = -(10 - x)*v[i - 1] - (20 - 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 (2, 10]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-ba5819a43d999a58
  • 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-ba5819a43d999a58
  • 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-ba5819a43d999a58

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