A257622 → Pₙ + Pₙ₊₁

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.

Triangle begins:
  0:       5,         4;
  1:      20,        60,          16;
  2:      80,       608,         568,           64;
  3:     320,      5248,       11592,         4760,           256;
  4:    1280,     41664,      182488,       176144,         37224,          1024;
  5:    5120,    315200,     2477416,      4629096,       2342936,        279256,          4096;
  6:   20480,   2315968,    30652056,     99302560,      97150880,      28624320,       2041832,        16384;
  7:   81920,  16711488,   356637160,   1866404440,    3129882096,    1799905616,     330328808,     14690136,       65536;
  8:  327680, 119225024,  3978045592,  32024236976,   85255263160,   83991785504,   30580968520,   3664428272,   104616808,    262144;
  9: 1310720, 844536640, 43074735336, 514781347272, 2063302745448, 3206588813064, 2011335196920, 488178424344, 39529532088, 740247512, 1048576;

The row polynomials satisfy P(n,x) = (4+(3*n-2)*x)*P(n-2,x) + (3*x-3*x^2)*d/dx P(n-2,x) + (3+(3*n+4)*x)*P(n-1,x) + (3*x-3*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 5 + 4*x, P(1,x) = 20 + 60*x + 16*x^2.

P[0, x_] := 5 + 4*x;
P[1, x_] := 20 + 60*x + 16*x^2;
P[n_, x_] := P[n, x] = Expand[(4 + (3*n - 2)*x)*P[n - 2, x] + (3*x - 3*x^2)*D[P[n - 2, x], x] + (3 + (3*n + 4)*x)*P[n - 1, x] + (3*x - 3*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 5 + 4*x; v[2] = 20 + 60*x + 16*x^2; for(n = 2, N, my(i = n + 1); v[i] = (4 + (3*n - 2)*x)*v[i - 2] + (3*x - 3*x^2)*deriv(v[i - 2], x) + (3 + (3*n + 4)*x)*v[i - 1] + (3*x - 3*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)

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-84efbcedb981a87c

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

• obreschkoff_combination e-84efbcedb981a87c

  Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?

  • premise (sequence): Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 4.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
    • theorem_check liu_wang e-36659981c068b032 root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

  • premise (sequence): Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3*x + 4.
    uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    no recorded property covers this requirement

Related sequences ?

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.