A099040 → x ↦ x−15

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-302-28
2870-1184756
3-252005160-3528-20384
4729900-19992020524-93616549584
5-211410007252200-99468068184-233632-14817600
6612333000-25239060043329240-3965752204096-560064399504448
7-177357600008536536000-1760313600201596160-13847936570560-13056128-10771231744
8513702810000-28277121600068077821600-9362880960804576016-442364801519680-29824256290408364288
9-148790115000009218974500000-2537994600000407473560000-420444120002891433760-1325305603904128-67072512-7829839711232
10430959260700000-29681671590000091969909920000-168831539280002033416437600-1678955903689624720960-3782508809753088-1489921024211104077714432
11-124824074760000009460092740400000-3258152942400000673134241680000-926925215040008932868749440-61477402521630214783360-103927398423826432-3276802048-5691678664089600
12361543446459000000-299001177165600000113312043023400000-260198986975200004032275327496000-44426740490496035684425445824-210539458291290558691840-276936499257154560-7147524096153456088418504704
13-104718311694900000009384354610722000000-3880698871280400000980510713837200000-16888101309144000020939201696649600-1922758614929280132394696827776-6835942134784261404992512-7195883520135034880-15482888192-4137403473123622912
14303308631690930000000-292781178452754000000131192311714822800000-361694981107044000006854443763197680000-94454550428022720097602094267992960-7682827446312832462940107778048-21249835711488731433123840-18307061760314966016-333414416384111550526771743309824

Computed in your browser ?

Technical details
Node id
n-22b2bd96c59e3f63 · revision 1 · JSON
Definition source
derived:basis_map_coefficients_of:oeis_catalog:A099040
Fingerprint
f6-3dd98d96997242cb

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:             -30,             2;
  2:             870,          -118,              4;
  3:          -25200,          5160,           -352,            8;
  4:          729900,       -199920,          20524,         -936,           16;
  5:       -21141000,       7252200,        -994680,        68184,        -2336,         32;
  6:       612333000,    -252390600,       43329240,     -3965752,       204096,      -5600,         64;
  7:    -17735760000,    8536536000,    -1760313600,    201596160,    -13847936,     570560,     -13056,     128;
  8:    513702810000, -282771216000,    68077821600,  -9362880960,    804576016,  -44236480,    1519680,  -29824,    256;
  9: -14879011500000, 9218974500000, -2537994600000, 407473560000, -42044412000, 2891433760, -132530560, 3904128, -67072, 512;
%F Formula
The row polynomials satisfy P(n,x) = -(30-2*x)*P(n-1,x) - (30-2*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -30 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := -30 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(30 - 2*x)*P[n - 1, x] - (30 - 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] = -30 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(30 - 2*x)*v[i - 1] - (30 - 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 (13, 15]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-48e4dfa7d694f880
  • 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-48e4dfa7d694f880
  • 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-48e4dfa7d694f880

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