Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074702
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074702 a(n) = ((n+1)^2*(n-1)*a(n-1)+(-1)^(n+1))/n. +0
1
1, 4, 43, 806, 23213, 947864, 51997111, 3685295242, 327581799289, 35673657942572, 4670006130663971, 723461783075360174, 130890931830249779173, 27346855400248614577216 (list; graph; listen)
OFFSET

1,2

FORMULA

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

CROSSREFS

Cf. A073701.

Sequence in context: A111829 A130545 A027311 this_sequence A152282 A153255 A015084

Adjacent sequences: A074699 A074700 A074701 this_sequence A074703 A074704 A074705

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 03 2002

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 18 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research