A257620 → 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:     4,         3;
  1:    12,        39,          9;
  2:    36,       333,        306,           27;
  3:   108,      2403,       5643,         2133,           81;
  4:   324,     15957,      78732,        75492,        13932,          243;
  5:   972,    101331,     941625,      1834650,       882090,        87723,          729;
  6:  2916,    627669,   10257030,     35920017,     35026992,      9476271,       540918,         2187;
  7:  8748,   3833811,  105231879,    613062027,   1058921343,    588292065,     96383277,      3295809,       6561;
  8: 26244,  23232501, 1037477808,   9538447410,  26816460372,  26370601056,   9055387224,    944928342,   19945440,     19683;
  9: 78732, 140162643, 9954696933, 139073307048, 600817591368, 954292817934, 583985437722, 131055397632, 9033001092, 120243447, 59049;

The row polynomials satisfy P(n,x) = (3+(3*n-3)*x)*P(n-2,x) + (3*x-3*x^2)*d/dx P(n-2,x) + (2+(3*n+3)*x)*P(n-1,x) + (3*x-3*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 4 + 3*x, P(1,x) = 12 + 39*x + 9*x^2.

P[0, x_] := 4 + 3*x;
P[1, x_] := 12 + 39*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[(3 + (3*n - 3)*x)*P[n - 2, x] + (3*x - 3*x^2)*D[P[n - 2, x], x] + (2 + (3*n + 3)*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] = 4 + 3*x; v[2] = 12 + 39*x + 9*x^2; for(n = 2, N, my(i = n + 1); v[i] = (3 + (3*n - 3)*x)*v[i - 2] + (3*x - 3*x^2)*deriv(v[i - 2], x) + (2 + (3*n + 3)*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-9a566c54793e3e13

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-9a566c54793e3e13

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

  • premise (sequence): Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m)…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
    • theorem_check liu_wang e-563d8c95cca8fabd root: theorem check

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

    • parent_provers root_domain e-f71cdfb9d254d483 root: theorem check

      Parent-row provers of polytool polytool ?

  • premise (sequence): Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m)…
    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.