A028338 → x ↦ (−1/2)x+1 (shift +2) → Pₙ + Pₙ₊₁

only rational roots

Proved for all n: all roots real what this means

Recurrence
\(\left(7 - x + 4\,n\right)\,P_{n}(x) = \left(-88 + 19\,x - x^{2} - 76\,n + 8\,n x - 16\,n^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = -352 + 164\,x - 23\,x^{2} + x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10Pn(1)
0-352164-231-210
15760-3024536-3913234
2-11673666944-138401320-591-62370
32826240-1736192401344-456802740-8311448370
4-7962624051720192-130314241685824-1226405068-1111-39369330
52559836160-1741897728470388736-671659525621504-2851528624-14311226506050
6-9248440320065482260480-187296808962895294464-27004185615907584-59606413776-1791-43091245890
73709945774080-2718956519424816604839936-13481705472013719956480-90750643239785088-114768020940-21911685628148050

Computed in your browser ?

Technical details
Node id
n-88fcd1b546ee4111 · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-84b877d940ba685c

Observed on the stored rows ?

  • Degrees: 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 (affine: slope 1, intercept 3)
  • 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 ℚ): yes

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:             -352,               164,              -23,                1;
  1:             5760,             -3024,              536,              -39,              1;
  2:          -116736,             66944,           -13840,             1320,            -59,              1;
  3:          2826240,          -1736192,           401344,           -45680,           2740,            -83,            1;
  4:        -79626240,          51720192,        -13031424,          1685824,        -122640,           5068,         -111,           1;
  5:       2559836160,       -1741897728,        470388736,        -67165952,        5621504,        -285152,         8624,        -143,         1;
  6:     -92484403200,       65482260480,     -18729680896,       2895294464,     -270041856,       15907584,      -596064,       13776,      -179,        1;
  7:    3709945774080,    -2718956519424,     816604839936,    -134817054720,    13719956480,     -907506432,     39785088,    -1147680,     20940,     -219,     1;
  8: -163618121318400,   123613143367680,  -38726423543808,    6760412020736,  -739598295040,    53715031040,  -2660469504,    90338688,  -2069760,    30580,  -263,    1;
  9: 7868890113638400, -6108193939783680, 1985824746897408, -363777325531136, 42317113163776, -3321614602240, 181579126784, -7001372928, 189771648, -3538480, 43208, -311, 1;
%F Formula
The row polynomials satisfy (4*n+7-x)*P(n,x) = -(16*n^2+76*n+88-(8*n+19)*x+x^2)*P(n-1,x) for n >= 1, with P(0,x) = -352 + 164*x - 23*x^2 + x^3.
%t Mathematica
P[0, x_] := -352 + 164*x - 23*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[(-(16*n^2 + 76*n + 88 - (8*n + 19)*x + x^2)*P[n - 1, x])/(4*n + 7 - x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = -352 + 164*x - 23*x^2 + x^3; for(n = 1, N, my(i = n + 1); v[i] = (-(16*n^2 + 76*n + 88 - (8*n + 19)*x + x^2)*v[i - 1])/(4*n + 7 - x)); 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 (-inf, +inf)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-f961be0564a72cf6

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

No candidate equalities or related sequences.

References

  1. [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
  2. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  3. [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.