A286718 → 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:           5,           6,           1;
  2:          32,          44,          13,          1;
  3:         308,         457,         171,         23,         1;
  4:        3920,        6132,        2644,        467,        36,         1;
  5:       61880,      100778,       47959,      10050,      1040,        52,       1;
  6:     1164800,     1959520,     1004544,     237574,     29705,      2025,      71,      1;
  7:    25450880,    43989048,    23923066,    6202357,    888069,     74102,    3584,     93,    1;
  8:   632952320,  1119583712,   639188488,  178298084,  28317982,   2734697,  163492,   5906,  118,   1;
  9: 17649632000, 31854922480, 18947969388, 5613611676, 968623473, 104673114, 7301931, 328584, 9207, 146, 1;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 2 + x; for(n = 1, N, my(i = n + 1); v[i] = ((9*n^2 - 4 + 6*n*x + x^2)*v[i - 1])/(3*n - 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-38cf740a66d8523a

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-38cf740a66d8523a

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

  • premise (sequence): Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
    • theorem_check liu_wang e-1844ef33b5ef77b8 root: theorem check

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

    • parent_provers root_domain e-576aa1dc371fa216 root: theorem check

      Parent-row provers of polytool polytool ?

    • basis_map A007318 e-fe032cf3f375eb62

      Geometric basis map (elementary) polytool ?

      • premise (sequence): basis-map coefficients of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • parent_provers root_domain e-aa6a1f197b91b3b6 root: theorem check

          Parent-row provers of polytool polytool ?

  • premise (sequence): Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 3*x)^(-1/3), (-1/3)*log(1 - 3*x)). A generalized Stirling1…
    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.