OFFSET
1,2
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..100
FORMULA
Recurrence: a(1) = 1, a(2) = 6, a(n) = n*(n+1)*a(n-1) - n*(n-1)^2*a(n-2) for n >=3. The sequence b(n) = n!^2 also satisfies this recurrence with the initial conditions b(1) = 1 and b(2) = 4. Hence we have the finite continued fraction expansion a(n)/b(n) = 1/(1-2/(6-12/(12-...-n*(n-1)^2/(n*(n+1))))). Lim_{n -> infinity} a(n)/b(n) = e - 1 = 1/(1-2/(6-12/(12-...-n*(n-1)^2/(n*(n+1))-...))) = 1/(1-1/(3-2/(4-...-n/(n+2)-...))). Cf. A000522 and A061572. - Peter Bala, Jul 10 2008
a(n) = n!*A002627(n). - R. J. Mathar, Mar 18 2017
Sum_{n>=1} a(n) * x^n / (n!)^2 = (exp(x) - 1) / (1 - x). - Ilya Gutkovskiy, Jul 15 2021
MATHEMATICA
Table[(n!)^2 Sum[1/k!, {k, n}], {n, 20}] (* Harvey P. Dale, Dec 02 2021 *)
PROG
(PARI) a(n) = { n!^2*sum(k=1, n, 1/k!) } \\ Harry J. Smith, Jul 24 2009
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
N. J. A. Sloane, May 19 2001
STATUS
approved