A201637 → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
122
2224
3210618
42306424120
52743864681201050
6216617804844382872011340
7235470623652061848347045040145530
8273425560227920702160819288346176403202162160
92149887210125830064095201322536811367432377424036288036486450
1023030286108638866050530500167797448249931200165920832447019203628800689188500
11260989138863057006435913472018037416884241599992480435086425518202565719852803991680014404039650
1221223828656641401202802365852496171973450886004409387210582259697694707271440413566583047867635840479001600329983453800
1322452288703226221356521472130055214987238100874376144516819193690753282642065263648192386796364870575715584011581508736062270208008222087723850
1424909427207684269708908487685870004121899993264083225521957763011809870841660044238938016666114548016964038750749260812666240103680181721957760087178291200221363900257500
1529824282915878114823567285048420585689393120840384860262169807044226654978816321169241846034272186189959583043217061140643272648775741572375042387192640998403028355527680013076743680006403741400306250

Computed in your browser ?

Technical details
Node id
n-55e6206734b15203 · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-398a8acb4f052aaf

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 -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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 2;
   2: 2,    2;
   3: 2,   10,      6;
   4: 2,   30,     64,      24;
   5: 2,   74,    386,     468,      120;
   6: 2,  166,   1780,    4844,     3828,       720;
   7: 2,  354,   7062,   36520,    61848,     34704,      5040;
   8: 2,  734,  25560,  227920,   702160,    819288,    346176,     40320;
   9: 2, 1498,  87210, 1258300,  6409520,  13225368,  11367432,   3774240,   362880;
  10: 2, 3030, 286108, 6388660, 50530500, 167797448, 249931200, 165920832, 44701920, 3628800;
%F Formula
The row polynomials satisfy P(n,x) = (1+(2*n-6)*x)*P(n-2,x) + (x-x^2)*d/dx P(n-2,x) + (2*n-2)*x*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 2, P(2,x) = 2 + 2*x.
%t Mathematica
P[1, x_] := 2;
P[2, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[(1 + (2*n - 6)*x)*P[n - 2, x] + (x - x^2)*D[P[n - 2, x], x] + (2*n - 2)*x*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 2; v[2] = 2 + 2*x; for(n = 3, N, my(i = n); v[i] = (1 + (2*n - 6)*x)*v[i - 2] + (x - x^2)*deriv(v[i - 2], x) + (2*n - 2)*x*v[i - 1] + (x - x^2)*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, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-ecc7f59b5400851a

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

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

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.