A232535 → basis A013610

OEIS matches ?

• A001019: 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 ?
• A100062: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?

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:      3,       6;
  2:     12,      42,       27;
  3:     48,     240,      333,      108;
  4:    192,    1248,     2664,     2052,      405;
  5:    768,    6144,    17712,    22032,    10935,      1458;
  6:   3072,   29184,   105984,   183168,   151956,     52974,     5103;
  7:  12288,  135168,   592128,  1313280,  1547424,    925344,   239841,    17496;
  8:  49152,  614400,  3151872,  8543232, 13115520,  11337408,  5143824,  1032264,   59049;
  9: 196608, 2752512, 16183296, 51867648, 98392320, 112223232, 74672928, 26663904, 4271211, 196830;

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

P[0, x_] := 1;
P[1, x_] := 3 + 6*x;
P[n_, x_] := P[n, x] = Expand[-9*x^2*P[n - 2, x] + (4 + 6*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] = 3 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = -9*x^2*v[i - 2] + (4 + 6*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-638c4e2ec1fd9933
• 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-638c4e2ec1fd9933
• 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-638c4e2ec1fd9933
• 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-638c4e2ec1fd9933

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-638c4e2ec1fd9933

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-a75bd3d9d36c6f35 root: theorem check

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

Related sequences ?

No candidate equalities or related sequences.

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