A133087 → basis A013611

OEIS matches ?

No OEIS matches.

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:   3,     4;
  2:   4,    16,     16;
  3:  12,    64,    112,     64;
  4:  16,   128,    384,    512,     256;
  5:  48,   448,   1664,   3072,    2816,    1024;
  6:  64,   768,   3840,  10240,   15360,   12288,    4096;
  7: 192,  2560,  14592,  46080,   87040,   98304,   61440,   16384;
  8: 256,  4096,  28672, 114688,  286720,  458752,  458752,  262144,   65536;
  9: 768, 13312, 102400, 458752, 1318912, 2523136, 3211264, 2621440, 1245184, 262144;

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

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

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

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 A013611 e-c8a75195ca564e89

  Geometric basis map (elementary) polytool ?

  • premise (sequence): A133080 * A007318.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • basis_map A007318 e-3537980ff71b1a89

      Geometric basis map (elementary) polytool ?

      • premise (sequence): Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • parent_provers periodic_product e-4d02ac33f5b2fbc9 root: theorem check

          Parent-row provers of polytool polytool ?

    • parent_provers periodic_product e-aa3a6b002de14e0c root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image affine, shift 0 e-28a1cf3333f63fa4

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

      • premise (sequence): Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ parent_provers periodic_product e-4d02ac33f5b2fbc9 (expanded above)

Related sequences ?

No candidate equalities or related sequences.