A008278 → x ↦ x+1 (shift +1) → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
0314
176114
2202811160
36713286201306
42556536072433711796
5108034204172242866770111838
6501718989288492229391021818135186204
7252871116082037721977201086423308049722641685346
81371226926501481015173741912096445031581186451371752115893892
9794545452639811114639153404441299727369176502264957424160382731034154419374
1048921673106156786260154137223084137455133896451693795114610043020152026810808420591536161852
1131858034223255120692607940124974975214483891201122536072586569216202939856442330815481276308794410815607932370
1221854375916766540815752311294116232384821532614211913797464393861384867437066875541068726661194562795199180438914478205161998997508
131573857867131277258584938992907111058984609216370216705916820349259812248180673563323586896228909629545581366360857736882730227402596375163981721798113886
14118631006921069447412684380810899831077525788129177117777509620482925048281707875837527103427927130945181704182113928147447329045200615379889282327021124276169263278318820260579516

Computed in your browser ?

Technical details
Node id
n-ac96e5d330bd4db3 · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-a3d909542641d2d2

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:      3,       1;
  1:      7,       6,        1;
  2:     20,      28,       11,        1;
  3:     67,     132,       86,       20,        1;
  4:    255,     653,      607,      243,       37,       1;
  5:   1080,    3420,     4172,     2428,      667,      70,       1;
  6:   5017,   18989,    28849,    22293,     9102,    1818,     135,      1;
  7:  25287,  111608,   203772,   197720,   108642,   33080,    4972,    264,     1;
  8: 137122,  692650,  1481015,  1737419,  1209644,  503158,  118645,  13717,   521,    1;
  9: 794545, 4526398, 11114639, 15340444, 12997273, 6917650, 2264957, 424160, 38273, 1034, 1;
%F Formula
The row polynomials satisfy P(n,x) = (n+(n-1)*x)*P(n-2,x) - (1+2*x+x^2)*d/dx P(n-2,x) + (n+1+(n+1)*x)*P(n-1,x) - (1+2*x+x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 3 + x, P(1,x) = 7 + 6*x + x^2.
%t Mathematica
P[0, x_] := 3 + x;
P[1, x_] := 7 + 6*x + x^2;
P[n_, x_] := P[n, x] = Expand[(n + (n - 1)*x)*P[n - 2, x] - (1 + 2*x + x^2)*D[P[n - 2, x], x] + (n + 1 + (n + 1)*x)*P[n - 1, x] - (1 + 2*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] = 3 + x; v[2] = 7 + 6*x + x^2; for(n = 2, N, my(i = n + 1); v[i] = (n + (n - 1)*x)*v[i - 2] - (1 + 2*x + x^2)*deriv(v[i - 2], x) + (n + 1 + (n + 1)*x)*v[i - 1] - (1 + 2*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-7a81e5633c7cc19a

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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  4. [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.