Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106174
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106174 a(n) = 2*n*a(n-1)-a(n-2). +0
4
0, 1, 4, 23, 180, 1777, 21144, 294239, 4686680, 84066001, 1676633340, 36801867479, 881568186156, 22883970972577, 639869619046000, 19173204600407423, 612902677593991536, 20819517833595304801, 748889739331836981300 (list; graph; listen)
OFFSET

0,3

COMMENT

Bessel recurance at x=1: J[x,n]=(2*n/x)*J[x,n-1]-J[x,n-2].

REFERENCES

Abramowitz and Stegun, Handbook of Mathematical Functions,9th printing,1972, page 385

LINKS

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

MATHEMATICA

F[0] = 0; F[1] = 1; F[n_] := F[n] = 2*n*F[n - 1] - F[n - 2] a = Table[F[n], {n, 0, 25}]

CROSSREFS

Sequence in context: A067545 A004041 A089465 this_sequence A056814 A058863 A108953

Adjacent sequences: A106171 A106172 A106173 this_sequence A106175 A106176 A106177

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 14 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research