A049374 → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
0718
14819168
2378294371710
3336044769966118894
43326470224243602520911130460
5362880115264858082489820534012712191640
643243201989187213907376300350426061010038169141397890
7558835203612913923392040969791812811598384641928173042171866554970
877837760069016147208488839744317591366449200782436623664140313627936271119874808560
911623772160138468185856218796754176103671247680203848444801956322368997476482799720428403311495003717260
101852538688002912896546560581902080883234295245205768370449841601005580699206543328176242505648519849063030397113291089894590
11313841848320064137068835840159815824616448115463215131264343802847548165058563590080407996132544191508498725387770089106020896284691382421070367190
1256317176115200147551001421824045333717710561283966772989763584142109689500979225179988138905624635932985664142275144211250394760416111239356815200328123864547111730978934458500
131067062284288000354072014360064001327890839372697601392915191420712965935598875119513612495331750277376145855904652057610144559974348843955086855681215789054482161126968243657961670766311381970711220623520
142128789257154560088483294425157632040147005552206192645004137615200948224251214353543881728062139907755813888085399049694486528703666319208652836512625973824012297034189440272842682112398843827237731330220710721113151315033291219450

Computed in your browser ?

Technical details
Node id
n-6ab27086b192524d · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-f99f37741a71f2e9

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 ℚ): 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:           7,            1;
  1:          48,           19,            1;
  2:         378,          294,           37,            1;
  3:        3360,         4476,          996,           61,           1;
  4:       33264,        70224,        24360,         2520,          91,          1;
  5:      362880,      1152648,       580824,        89820,        5340,        127,        1;
  6:     4324320,     19891872,     13907376,      3003504,      260610,      10038,      169,       1;
  7:    55883520,    361291392,    339204096,     97918128,    11598384,     641928,    17304,     217,     1;
  8:   778377600,   6901614720,   8488839744,   3175913664,   492007824,   36623664,  1403136,   27936,   271,   1;
  9: 11623772160, 138468185856, 218796754176, 103671247680, 20384844480, 1956322368, 99747648, 2799720, 42840, 331, 1;
%F Formula
The row polynomials satisfy P(n,x) = (n+4+x)*P(n-2,x) + 5*x*d/dx P(n-2,x) + (n+5+x)*P(n-1,x) + 5*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 7 + x, P(1,x) = 48 + 19*x + x^2.
%t Mathematica
P[0, x_] := 7 + x;
P[1, x_] := 48 + 19*x + x^2;
P[n_, x_] := P[n, x] = Expand[(n + 4 + x)*P[n - 2, x] + 5*x*D[P[n - 2, x], x] + (n + 5 + x)*P[n - 1, x] + 5*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 7 + x; v[2] = 48 + 19*x + x^2; for(n = 2, N, my(i = n + 1); v[i] = (n + 4 + x)*v[i - 2] + 5*x*deriv(v[i - 2], x) + (n + 5 + x)*v[i - 1] + 5*x*deriv(v[i - 1], 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-0a2b33f6b07eac20

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.