Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121965
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121965 Bessel-Benet recursion derived from Z(p-1)+Z(p+1)=(2*p)/x)*Z(p) that is A001503-like: at x=2: a[n]=(n-1)*a[n-1]-a[n-2]. +0
1
0, 1, 0, 0, 1, 6, 32, 190, 1303, 10240, 90864, 898408, 9791633, 116601198, 1506023952, 20967734142, 313009988191, 4987192076928, 84469255319600, 1515459403675887, 28709259414522264, 572669728886769472 (list; graph; listen)
OFFSET

1,6

REFERENCES

Eugene Jahnke and Fritz Emde, Table of Functions with Formulae and Curves, Dover Book, New York,1945, page144

FORMULA

a(n) = (BesselJ[n, 2] BesselY[0, 2] - BesselJ[0, 2] BesselY[n, 2])/(BesselJ[1, 2]BesselY[0, 2] - BesselJ[0, 2] BesselY[1, 2])

MATHEMATICA

Needs["DiscreteMath`RSolve`"]; Clear[f]; f[n_Integer] = Module[{a}, a[n] /.RSolve[{a[n] == (n - 1)*a[n - 1] - a[n - 2], a[0] == 0, a[1] == 1}, a[n], n][[1]] // Simplify] // ToRadicals Table[Floor[N[f[n]]], {n, 0, 25}]

CROSSREFS

Cf. A001503 : added A106174.

Sequence in context: A000558 A047763 A026993 this_sequence A108188 A020058 A146557

Adjacent sequences: A121962 A121963 A121964 this_sequence A121966 A121967 A121968

KEYWORD

nonn,uned

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 02 2006

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research