OFFSET
0,3
COMMENTS
if s(n) is a sequence defined as s(0)=x, s(n) = n^2*s(n-1) + k, then s(n) = n!^2*x + a(n)*k. - Gary Detlefs, Feb 20 2010
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..100
Alexandre Silva, Carlos Pereira dos Santos, João Pedro Neto, and Richard J. Nowakowski, Disjunctive sums of quasi-nimbers, Theor. Comp. Sci. (2022).
FORMULA
a(n) = (n!)^2*Sum_{i=1..n} 1/(i!)^2.
a(n) = floor((1-BesselI(0, 2))*(n!)^2). - Benoit Cloitre, Nov 02 2002
Sum_{n>=0} a(n) * x^n / (n!)^2 = (BesselI(0,2*sqrt(x)) - 1) / (1 - x). - Ilya Gutkovskiy, Jan 23 2021
MATHEMATICA
RecurrenceTable[{a[0]==0, a[n]==n^2 a[n-1]+1}, a, {n, 20}] (* Harvey P. Dale, Jan 24 2019 *)
PROG
(PARI) { for (n=0, 100, if (n==0, a=0, a=n^2*a + 1); write("b066998.txt", n, " ", a) ) } \\ Harry J. Smith, Apr 24 2010
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 27 2002
EXTENSIONS
Better description from James D. Klein, Feb 25 2002
STATUS
approved