login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074702 a(n) = ((n+1)^2*(n-1)*a(n-1)+(-1)^(n+1))/n. 1
1, 4, 43, 806, 23213, 947864, 51997111, 3685295242, 327581799289, 35673657942572, 4670006130663971, 723461783075360174, 130890931830249779173, 27346855400248614577216, 6534075316966068976316143, 1770326031190494313270654994, 539845302687736618823239734641 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

a(n) = round((n+1)!^2*BesselJ(0, 2))/n.

MATHEMATICA

nxt[{n_, a_}]:={n+1, (n*a*(n+2)^2+(-1)^(n+2))/(n+1)}; Transpose[ NestList[ nxt, {1, 1}, 15]][[2]] (* Harvey P. Dale, Jun 26 2013 *)

CROSSREFS

Cf. A073701.

Sequence in context: A198205 A277639 A326432 * A197717 A277456 A317140

Adjacent sequences: A074699 A074700 A074701 * A074703 A074704 A074705

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Sep 03 2002

EXTENSIONS

More terms from Emeric Deutsch, Dec 18 2003

More terms from Harvey P. Dale, Jun 26 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 09:19 EST 2022. Contains 358438 sequences. (Running on oeis4.)