A120910 → basis A013611

OEIS matches ?

• A169634: 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:     3;
  1:     9,     12;
  2:    27,     72,      48;
  3:    81,    324,     432,      192;
  4:   243,   1296,    2592,     2304,      768;
  5:   729,   4860,   12960,    17280,    11520,     3072;
  6:  2187,  17496,   58320,   103680,   103680,    55296,    12288;
  7:  6561,  61236,  244944,   544320,   725760,   580608,   258048,    49152;
  8: 19683, 209952,  979776,  2612736,  4354560,  4644864,  3096576,  1179648,  196608;
  9: 59049, 708588, 3779136, 11757312, 23514624, 31352832, 27869184, 15925248, 5308416, 786432;

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

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

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

Proof chains

2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

• basis_map A013611 e-1a05d30902084644

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-26e15e96a906c1df root: theorem check

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

    • parent_provers periodic_product e-3e9b67ef5f31843c root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image reversal, shift 0 e-b63d4680864933c7

      Affine, reversal and Möbius substitutions (elementary) polytool ?

      • premise (sequence): Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check liu_wang e-f5018d5f4ba5a310 root: theorem check

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

        • preserver_image reversal, shift 0 e-98e1992c4c48b815

          Affine, reversal and Möbius substitutions (elementary) polytool ?

          • premise (sequence): Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • ↵ theorem_check liu_wang e-26e15e96a906c1df (expanded above)
            • ↵ parent_provers periodic_product e-3e9b67ef5f31843c (expanded above)
        • parent_provers periodic_product e-f91a02f39edc297f root: theorem check

          Parent-row provers of polytool polytool ?

• basis_map A013609 e-1a859dc366b58cfd

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • ↵ theorem_check liu_wang e-f5018d5f4ba5a310 (expanded above)
    • ↵ preserver_image reversal, shift 0 e-98e1992c4c48b815 (expanded above)
    • ↵ parent_provers periodic_product e-f91a02f39edc297f (expanded above)

Related sequences ?

Same fingerprint (6)

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

• A027465 → x ↦ x/(x+1)
• A038330 → basis A013610
• A013609 → basis A013609
• A013610 → basis A007318
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*6^j.
• A038335: Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*9^j.

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