cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Michael R. Powers

Michael R. Powers's wiki page.

Michael R. Powers has authored 1 sequences.

A381681 a(n) is one of two integer components (with A000254) used in computing the inverse second moment of X+n, where X~Poisson(1).

Original entry on oeis.org

0, 1, 2, 7, 30, 159, 998, 7251, 59862, 553591, 5669406, 63698427, 779065694, 10304068863, 146547757014, 2230287456259, 36165665815878, 622513383121671, 11336090988469742, 217741030441959051, 4399571340398826126, 93286012779568250767, 2071087588405552461414, 48048511292938827392403
Offset: 0

Author

Michael R. Powers, Mar 05 2025

Keywords

Comments

Analog of A093344 (with alternating terms in inner summation).

Examples

			If X~Poisson(1), then E[(X+n)^(-2)] = (-1)^n * {(n-1)! * [-Ei(1)+gamma] - A000254(n-1) + e*a(n-1)}/e for n = 1,2,... where gamma is Euler's constant.
		

Crossrefs

A093344 gives one of two integer components (with A000254) used in computing the alternating inverse second moment of X+n for X~Poisson(1).

Programs

  • PARI
    a(n) = n! * sum(i=1, n, (1/i)*sum(j=0, i-1, (-1)^j/j!)); \\ Michel Marcus, Mar 07 2025

Formula

a(n) = n! * Sum_{i=1..n} (1/i)*Sum_{j=0..i-1} (-1)^j/j!.