A142462 → 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: 2,         1;
  1: 2,        17,            1;
  2: 2,       159,          144,             1;
  3: 2,      1309,         4433,          1167,              1;
  4: 2,     10523,        94292,         91168,           9358,              1;
  5: 2,     84249,      1711385,       4050090,        1630740,          74893,              1;
  6: 2,    674071,     28638240,     138102131,      135763426,       27091749,         599180,             1;
  7: 2,   5392661,    458034409,    4057873841,     7914380537,     3950748655,      431616731,       4793483,            1;
  8: 2,  43141395,   7135954932,  108779586090,   374661499548,   370804992852,   105286871844,    6709730862,     38347914,         1;
  9: 2, 345131281, 109464829121, 2746931517716, 15515239566176, 26782332056942, 15253214159414, 2648780600804, 102798239654, 306783369, 1;

The row polynomials satisfy P(n,x) = (1+(7*n-13)*x)*P(n-2,x) + (7*x-7*x^2)*d/dx P(n-2,x) + (7*n+1)*x*P(n-1,x) + (7*x-7*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2 + x, P(1,x) = 2 + 17*x + x^2.

P[0, x_] := 2 + x;
P[1, x_] := 2 + 17*x + x^2;
P[n_, x_] := P[n, x] = Expand[(1 + (7*n - 13)*x)*P[n - 2, x] + (7*x - 7*x^2)*D[P[n - 2, x], x] + (7*n + 1)*x*P[n - 1, x] + (7*x - 7*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] = 2 + x; v[2] = 2 + 17*x + x^2; for(n = 2, N, my(i = n + 1); v[i] = (1 + (7*n - 13)*x)*v[i - 2] + (7*x - 7*x^2)*deriv(v[i - 2], x) + (7*n + 1)*x*v[i - 1] + (7*x - 7*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-1b90717a181c7212

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-1b90717a181c7212

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

  • premise (sequence): Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-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-9263744ab96a6b52 root: theorem check

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

  • premise (sequence): Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-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.