A094816 → x ↦ x/(x+1)

OEIS matches ?

• A081367: 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: 1,      2;
   3: 1,      5,       5;
   4: 1,     11,      25,      16;
   5: 1,     28,     107,     144,       65;
   6: 1,     94,     511,    1054,      961,      326;
   7: 1,    421,    2904,    7971,    10844,     7313,     1957;
   8: 1,   2379,   19496,   66009,   118196,   118131,    62525,    13700;
   9: 1,  16080,  151150,  604136,  1331819,  1750008,  1371390,   593736,  109601;
  10: 1, 125682, 1327110, 6089684, 15870051, 25704006, 26506726, 17002476, 6204369, 986410;

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

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

P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; for(n = 3, N, my(i = n); v[i] = (-(n - 2 + (3*n - 6)*x + (3*n - 6)*x^2 + (n - 2)*x^3)*v[i - 2] + (n - 1 + (2*n - 1)*x + n*x^2)*v[i - 1])/(1 + x)); 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 [-1, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-d35851ec1bbd1c60
• 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-d35851ec1bbd1c60
• 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-d35851ec1bbd1c60

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

• preserver_image mobius, shift 0 e-d35851ec1bbd1c60

  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 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 (expanded above)

Related sequences ?

Same fingerprint (1)

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

• A046716 → basis A007318

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