login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074703 a(n) = n^2*a(n-1)+1, a(1)=0. 1
0, 1, 10, 161, 4026, 144937, 7101914, 454522497, 36816322258, 3681632225801, 445477499321922, 64148759902356769, 10841140423498293962, 2124863523005665616553, 478094292676274763724426 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..253

FORMULA

a(n) = round(n!^2*(BesselI(0, 2)-2)).

MATHEMATICA

nxt[{n_, a_}]:={n+1, (n+1)^2 a+1}; Transpose[NestList[nxt, {1, 0}, 20]][[2]] (* Harvey P. Dale, Dec 11 2013 *)

PROG

(PARI) a(n)=round((besseli(0, 2)-2)*n!^2) \\ Charles R Greathouse IV, Feb 19 2014

CROSSREFS

Cf. A006040, A073701.

Sequence in context: A090374 A034724 A234283 * A190903 A303486 A064747

Adjacent sequences:  A074700 A074701 A074702 * A074704 A074705 A074706

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Sep 03 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 14:15 EST 2019. Contains 329806 sequences. (Running on oeis4.)