A038336 → Pₙ + Pₙ₊₁

OEIS matches ?

• A168796: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168700: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168988: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168940: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A167937: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168892: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168748: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168844: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS

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:          1872,           4560,            3700,             1000;
  1:         22464,          73440,           90000,            49000,            10000;
  2:        269568,        1105920,         1814400,          1488000,           610000,           100000;
  3:       3234816,       15966720,        32832000,         36000000,         22200000,          7300000,          1000000;
  4:      38817792,      223948800,       553651200,        760320000,        626400000,        309600000,         85000000,         10000000;
  5:     465813504,     3075563520,      8883302400,      14660352000,      15120000000,       9979200000,       4116000000,        970000000,        100000000;
  6:    5589762048,    41564897280,    137355264000,     264757248000,     328043520000,     270950400000,     149184000000,      52800000000,      10900000000,      1000000000;
  7:   67077144576,   554676387840,   2063912140800,    4550639616000,    6584094720000,    6531840000000,    4499712000000,    2125440000000,     658800000000,    121000000000,    10000000000;
  8:  804925734912,  7326888099840,  30313709568000,   75246796800000,  124515532800000,  144223027200000,  119314944000000,   70502400000000,   29160000000000,   8040000000000,  1330000000000,   100000000000;
  9: 9659108818944, 95971914547200, 437033395814400, 1206098657280000, 2246654361600000, 2975831654400000, 2874009600000000, 2039178240000000, 1054944000000000, 388080000000000, 96360000000000, 14500000000000, 1000000000000;

The row polynomials satisfy P(n,x) = (12+10*x)*P(n-1,x) for n >= 1, with P(0,x) = 1872 + 4560*x + 3700*x^2 + 1000*x^3.

P[0, x_] := 1872 + 4560*x + 3700*x^2 + 1000*x^3;
P[n_, x_] := P[n, x] = Expand[(12 + 10*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1872 + 4560*x + 3700*x^2 + 1000*x^3; for(n = 1, N, my(i = n + 1); v[i] = (12 + 10*x)*v[i - 1]); 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-0e5e881cd5b1385e

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-0e5e881cd5b1385e

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

  • premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
    • theorem_check liu_wang e-2f1e093ae220e593 root: theorem check

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

    • parent_provers periodic_product e-3f0a5f7ceded39cb root: theorem check

      Parent-row provers of polytool polytool ?

  • premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.
    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.