A046716 → basis A013610

OEIS matches ?

• A094856: 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:
   1:      1;
   2:      2,        3;
   3:      5,       15,         9;
   4:     16,       75,        99,        27;
   5:     65,      432,       963,       756,         81;
   6:    326,     2883,      9486,     13797,       7614,        243;
   7:   1957,    21939,     97596,    215217,     235224,     102303,        729;
   8:  13700,   187575,   1063179,   3191292,    5346729,    4737528,    1734291,       2187;
   9: 109601,  1781208,  12342510,  47250216,  107877339,  146805048,  110188350,   35166960,      6561;
  10: 986410, 18613107, 153022284, 715681602, 2082024486, 3856422393, 4439379636, 2902389570, 824599602, 19683;

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

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

P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + 3*x; for(n = 3, N, my(i = n); v[i] = -(n - 2 + (6*n - 12)*x + (9*n - 18)*x^2)*v[i - 2] + (n + (3*n - 3)*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, v[i])))};
T(10)

Proved properties

• Real-rooted. Every row P_n, n >= 1, 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-3699a0e7eb346ca6
• Coefficients of one sign. Every nonzero row, n >= 1: 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-3699a0e7eb346ca6
• Hadamard kernel (Malo). Rows P_n, n >= 1, 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-3699a0e7eb346ca6
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-3699a0e7eb346ca6

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-3699a0e7eb346ca6

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Coefficients of a special case of Poisson-Charlier polynomials.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-3fcbce34648f287c root: theorem check

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

    • preserver_image reversal, shift 0 e-1f661e973532853d

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

      • premise (sequence): Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n.
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check three_term_recurrence e-503a12a637bb094e root: theorem check

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

        • preserver_image reversal, shift 0 e-10ee31afdeccb0f4

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

          • premise (sequence): Coefficients of a special case of Poisson-Charlier polynomials.
            uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
            • ↵ theorem_check three_term_recurrence e-3fcbce34648f287c (expanded above)

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