A091044 → basis A013609

OEIS matches ?

• A099156: row sums, 15 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:      1;
  1:      4,       4;
  2:     16,      32,      12;
  3:     64,     192,     160,       32;
  4:    256,    1024,    1344,      640,       80;
  5:   1024,    5120,    9216,     7168,     2240,      192;
  6:   4096,   24576,   56320,    61440,    32256,     7168,     448;
  7:  16384,  114688,  319488,   450560,   337920,   129024,   21504,    1024;
  8:  65536,  524288, 1720320,  2981888,  2928640,  1622016,  473088,   61440,   2304;
  9: 262144, 2359296, 8912896, 18350080, 22364160, 16400384, 7028736, 1622016, 168960, 5120;

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

P[0, x_] := 1;
P[1, x_] := 4 + 4*x;
P[n_, x_] := P[n, x] = Expand[-4*x^2*P[n - 2, x] + (4 + 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] = 1; v[2] = 4 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -4*x^2*v[i - 2] + (4 + 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-e191260c8ae7a4a6
• 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-e191260c8ae7a4a6
• 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-e191260c8ae7a4a6
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-e191260c8ae7a4a6

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 A013609 e-e191260c8ae7a4a6

  Geometric basis map (elementary) polytool ?

  • premise (sequence): One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-4ffbabf9b60188a8 root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

    • preserver_image reversal, shift 0 e-75f779345b39f910

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

      • premise (sequence): One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check three_term_recurrence e-4ffbabf9b60188a8 (expanded above)

Related sequences ?

Same fingerprint (2)

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

• chebyshev_u → x ↦ x+1
• A053117 → x ↦ x+1

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023