A163936 → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
1314
289118
33066231120
41445023505311050
5840415247281504115111340
6576037692625403357257242411145530
7453603751208434446761402014102019049512162160
84032004075056118116001308408459613001082450677541005136486450
939916804807296017321320825134496816112288445827500539342021985220271689188500
10435456006126955202669668128488106885641580524721693149304319695880254627526970644073114404039650
115189184008396075520432957830409684195417610518312811257689783088158633305042076726680115571414217469881671329983453800
1267060224001231638048007387177386241975279452048265104590644818742300410887032690071681363749030001278469415250942990267078621635718222087723850
1393405312000192632864256013248833454720415726577176326727824061329659312562106896289876301124967769155569616109734633019275523311504219652950420524344327391221363900257500
141394852659200320073695424002494591755609609047128312753921731152861411328185466559415515211400473826357924020004199649127947606134372883834603801964320158361489313034908624406286550516403741400306250

Computed in your browser ?

Technical details
Node id
n-770bc0f5eb42b52a · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-78696c1f329edd89

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): 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:       2;
  1:       3,        1;
  2:       8,        9,         1;
  3:      30,       66,        23,         1;
  4:     144,      502,       350,        53,         1;
  5:     840,     4152,      4728,      1504,       115,        1;
  6:    5760,    37692,     62540,     33572,      5724,      241,       1;
  7:   45360,   375120,    843444,    676140,    201410,    20190,     495,      1;
  8:  403200,  4075056,  11811600,  13084084,   5961300,  1082450,   67754,   1005,    1;
  9: 3991680, 48072960, 173213208, 251344968, 161122884, 45827500, 5393420, 219852, 2027, 1;
%F Formula
The row polynomials satisfy P(n,x) = (n-1+(n-2)*x)*P(n-2,x) + (x-x^2)*d/dx P(n-2,x) + (n+n*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 3 + x.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 3 + x;
P[n_, x_] := P[n, x] = Expand[(n - 1 + (n - 2)*x)*P[n - 2, x] + (x - x^2)*D[P[n - 2, x], x] + (n + n*x)*P[n - 1, x] + (x - x^2)*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] = 2; v[2] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = (n - 1 + (n - 2)*x)*v[i - 2] + (x - x^2)*deriv(v[i - 2], x) + (n + n*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 - 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-e0e39e6ac529ed26

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.