A028338 → Pₙ + Pₙ₊₁

nonnegative coefficients only rational roots

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
0213
145110
2182710156
312019995171432
41050186510362462614224
5113402121313089371053037149920
614553028373118947060859105501009501691200
7216216043624473101503109539521809925613175765110967040
8364864507579534556733336216084604782988651574553842860821196116480
968918850014684015251147880385465218044112069124171136141700454109596441610113901685760
101440403965031382226315254662712821087631842128095197804702011505271579639963782021706535122185465497600
11329983453800733401836055614918323359274732299765752802849811359117287016793709021444188908637618352275933914512043740160000
1282220877238501860505831138516057615519908746236247584221513353731104141521777915547330738452820639963599636701743162358550812962170152973744947200
132213639002575005091518295029254509795851023052170128011097546540326103103013307169256667190867487339119780797665214984203520829925811332219039351941755019711479340877414400
14640374140030625014950963671847875135566256586765506729954693591375210954985678218645050914003559168551050574006763482312693163164683095839017880473179220841860316893144380623261226144278202813644800

Computed in your browser ?

Technical details
Node id
n-8cae8db3d01b43b1 · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-c0a519a80d51f885

Observed on the stored rows ?

  • Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (affine: slope 1, intercept 1)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • 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:         2,          1;
  1:         4,          5,          1;
  2:        18,         27,         10,         1;
  3:       120,        199,         95,        17,         1;
  4:      1050,       1865,       1036,       246,        26,        1;
  5:     11340,      21213,      13089,      3710,       530,       37,       1;
  6:    145530,     283731,     189470,     60859,     10550,     1009,      50,      1;
  7:   2162160,    4362447,    3101503,   1095395,    218099,    25613,    1757,     65,    1;
  8:  36486450,   75795345,   56733336,  21608460,   4782988,   651574,   55384,   2860,   82,   1;
  9: 689188500, 1468401525, 1147880385, 465218044, 112069124, 17113614, 1700454, 109596, 4416, 101, 1;
%F Formula
The row polynomials satisfy (2*n+x)*P(n,x) = (4*n^2+2*n-2+(4*n+1)*x+x^2)*P(n-1,x) for n >= 1, with P(0,x) = 2 + x.
%t Mathematica
P[0, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^2 + 2*n - 2 + (4*n + 1)*x + x^2)*P[n - 1, x])/(2*n + x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2 + x; for(n = 1, N, my(i = n + 1); v[i] = ((4*n^2 + 2*n - 2 + (4*n + 1)*x + x^2)*v[i - 1])/(2*n + 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-3733e878156287d8

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.