A038335 → basis A007318

OEIS matches ?

• A009974: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 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:           21,             9;
  2:          441,           378,            81;
  3:         9261,         11907,          5103,           729;
  4:       194481,        333396,        214326,         61236,          6561;
  5:      4084101,       8751645,       7501410,       3214890,        688905,         59049;
  6:     85766121,     220541454,     236294415,     135025380,      43401015,       7440174,       531441;
  7:   1801088541,    5403265623,    6947055801,    4962182715,    2126649735,     546852789,     78121827,     4782969;
  8:  37822859361,  129678374952,  194517562428,  166729339224,   89319288870,   30623756184,   6562233468,   803538792,   43046721;
  9: 794280046581, 3063651608241, 5251974185556, 5251974185556, 3376269119286, 1446972479694, 413420708484, 75934415844, 8135830269, 387420489;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(21 + 9*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] = (21 + 9*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, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-9b0235f0075e4320
• 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-9b0235f0075e4320
• 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-9b0235f0075e4320

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 A007318 e-9b0235f0075e4320

  Geometric basis map (elementary) polytool ?

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

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

    • parent_provers periodic_product e-2dcf274e8e5380c5 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

Same fingerprint (2)

Equal up to content, sign, reversal and a small index shift.

• A038255 → basis A013610
• A038284 → basis A007318

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