A038314 → Pₙ + Pₙ₊₁

OEIS matches ?

• A168844: 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
• A168892: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168796: 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
• A168748: 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

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:          1100,           3840,            4464,            1728;
  1:         11000,          51600,           90720,           70848,            20736;
  2:        110000,         648000,         1526400,         1797120,          1057536,           248832;
  3:       1100000,        7800000,        23040000,        36288000,         32140800,         15178752,          2985984;
  4:      11000000,       91200000,       324000000,       639360000,        756864000,        537477120,        212004864,         35831808;
  5:     110000000,     1044000000,      4334400000,     10281600000,      15240960000,      14457139200,       8569774080,       2902376448,        429981696;
  6:    1100000000,    11760000000,     55872000000,    154828800000,     275788800000,     327462912000,     259183411200,     131861053440,      39128334336,       5159780352;
  7:   11000000000,   130800000000,    699840000000,   2218752000000,    4615833600000,    6584094720000,    6521389056000,    4428811468800,    1973615984640,     521137815552,     61917364224;
  8:  110000000000,  1440000000000,   8568000000000,  30585600000000,   72783360000000,  121230950400000,  144223027200000,  122544783360000,   72881897472000,   28894769971200,   6872827428864,   743008370688;
  9: 1100000000000, 15720000000000, 102960000000000, 408672000000000, 1094860800000000, 2085709824000000, 2897001676800000, 2956124160000000, 2199356375040000, 1163530469376000, 415465513943040, 89904012853248, 8916100448256;

The row polynomials satisfy P(n,x) = (10+12*x)*P(n-1,x) for n >= 1, with P(0,x) = 1100 + 3840*x + 4464*x^2 + 1728*x^3.

P[0, x_] := 1100 + 3840*x + 4464*x^2 + 1728*x^3;
P[n_, x_] := P[n, x] = Expand[(10 + 12*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1100 + 3840*x + 4464*x^2 + 1728*x^3; for(n = 1, N, my(i = n + 1); v[i] = (10 + 12*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-4dc01c187e0a54c1

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-4dc01c187e0a54c1

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

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

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

    • parent_provers periodic_product e-08ecf9f1e7a97c44 root: theorem check

      Parent-row provers of polytool polytool ?

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