A286718 → basis A013610

OEIS matches ?

• A034000: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
• A225477: triangle, 45 terms agree, 9 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 terms from n = 0 ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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:          1;
  1:          2,          3;
  2:         10,         21,           9;
  3:         80,        198,         135,         27;
  4:        880,       2418,        2079,        702,         81;
  5:      12320,      36492,       36360,      16065,       3240,       243;
  6:     209440,     657324,      727596,     382185,     103275,     13851,       729;
  7:    4188800,   13774800,    16523892,    9826488,    3212055,    586845,     56133,     2187;
  8:   96342400,  329386800,   421373916,  275580900,  103356729,  23133600,   3051594,   218700,   6561;
  9: 2504902400, 8853084000, 11943882216, 8429225148, 3514017654, 911543787, 148742244, 14840982, 826686, 19683;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (3*n - 1 + 3*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)

Triangle begins:
  0:          1;
  1:          2,          3;
  2:         10,         21,           9;
  3:         80,        198,         135,         27;
  4:        880,       2418,        2079,        702,         81;
  5:      12320,      36492,       36360,      16065,       3240,       243;
  6:     209440,     657324,      727596,     382185,     103275,     13851,       729;
  7:    4188800,   13774800,    16523892,    9826488,    3212055,    586845,     56133,     2187;
  8:   96342400,  329386800,   421373916,  275580900,  103356729,  23133600,   3051594,   218700,   6561;
  9: 2504902400, 8853084000, 11943882216, 8429225148, 3514017654, 911543787, 148742244, 14840982, 826686, 19683;

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

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

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (3*n - 1 + 3*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-ccb031147de5168b
• Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
  All coefficients of each polynomial have the same sign (after x -> -x when alternating).
  derived from the cited steps by a stated theorem: e-ccb031147de5168b
• Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
  Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
  derived from the cited steps by a stated theorem: e-ccb031147de5168b

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

• basis_map A013610 e-ccb031147de5168b

  Geometric basis map (elementary) 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: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • 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 ?

Related sequences ?

No candidate equalities or related sequences.

References

1. [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