A144697 → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
0235
1213924
22357627140
328139340381960
421751640351019902437560
5236560892355427124933772967200
6274721068135525273810189733422082187665280
7215136968170586922973052756043123502718559965617257600
823047223672343431217018372323687982500080876184487992581968386486400
92611770352115920580115409904328311054399011838209758884451021503387301590491117670400
1021225921819327125076773341177229935857985389777904444734667816570376182585910631417906017714715567552000
11224545670108131065301544377402652519519226664372199850783217920784584244146012483826885144555735758782955531441232475443200
12249119204386961328077418258583637701993533249816998622534721200909561948103491128693444412263090590548868792791906223424186340615943233705077376000
1329826962036505559339903014630434600415026155463917069422224967165465414037802004831087069012676286891227409266736960763689052221442680929640989242705478296962768369664000
1421965711876490682328875738580875371830210895596181363673404889306082094954710779293447733790813103062069851748411459977421680283620224042237143683347621782270127141054027121032143489071126343522304000

Computed in your browser ?

Technical details
Node id
n-936d6bd12d8bd41c · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-f1777e18cc7873d6

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: 2,    3;
  1: 2,   13,      9;
  2: 2,   35,     76,       27;
  3: 2,   81,    393,      403,        81;
  4: 2,  175,   1640,     3510,      1990,       243;
  5: 2,  365,   6089,    23554,     27124,      9337,       729;
  6: 2,  747,  21068,   135525,    273810,    189733,     42208,      2187;
  7: 2, 1513,  69681,   705869,   2297305,   2756043,   1235027,    185599,     6561;
  8: 2, 3047, 223672,  3434312,  17018372,  32368798,  25000808,   7618448,   799258,   19683;
  9: 2, 6117, 703521, 15920580, 115409904, 328311054, 399011838, 209758884, 45102150, 3387301, 59049;
%F Formula
The row polynomials satisfy P(n,x) = (1+(n+1)*x)*P(n-2,x) + (x-x^2)*d/dx P(n-2,x) + (n+3)*x*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2 + 3*x, P(1,x) = 2 + 13*x + 9*x^2.
%t Mathematica
P[0, x_] := 2 + 3*x;
P[1, x_] := 2 + 13*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[(1 + (n + 1)*x)*P[n - 2, x] + (x - x^2)*D[P[n - 2, x], x] + (n + 3)*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 + 3*x; v[2] = 2 + 13*x + 9*x^2; for(n = 2, N, my(i = n + 1); v[i] = (1 + (n + 1)*x)*v[i - 2] + (x - x^2)*deriv(v[i - 2], x) + (n + 3)*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-b4867a0cc7e138f4

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.