Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093858
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093858 a(0) = 1, a(1)= 2, a(n) = {a(n+1)-a(n-1)}/n, or a(n+1) = n*a(n) +a(n-1). +0
2
1, 2, 3, 8, 27, 116, 607, 3758, 26913, 219062, 1998471, 20203772, 224239963, 2711083328, 35468323227, 499267608506, 7524482450817, 120890986821578, 2062671258417643, 37248973638339152, 709793170386861531 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = -2*(BesselI[n, -2]*(2 BesselK[0, 2] - BesselK[1, 2]) + (-2 BesselI[0, 2] + BesselI[1, -2])*BesselK[n, 2]) - Ryan Propper (rpropper(AT)stanford.edu), Sep 14 2005

MATHEMATICA

a = 1; b = 2; Print[a]; Print[b]; Do[c = n*b + a; Print[c]; a = b; b = c, {n, 1, 30}] (Propper)

CROSSREFS

Sequence in context: A041503 A086613 A121401 this_sequence A080568 A091339 A006277

Adjacent sequences: A093855 A093856 A093857 this_sequence A093859 A093860 A093861

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 19 2004

EXTENSIONS

More terms from Ryan Propper (rpropper(AT)stanford.edu), Sep 14 2005

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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research