Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121966
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121966 a(n) = a(n-1)-(n-1)*a(n-2). +0
9
1, 2, 1, -3, -6, 6, 36, 0, -252, -252, 2016, 4536, -17640, -72072, 157248, 1166256, -1192464, -19852560, 419328, 357765408, 349798176, -6805509984, -14151271680, 135569947968, 461049196608, -2792629554624, -14318859469824, 58289508950400, 444898714635648 (list; graph; listen)
OFFSET

1,2

COMMENT

Hermite type recursion suggested by H[n+1]=x*H[n]-n*H[n-1]; x=1.

REFERENCES

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

MATHEMATICA

a[0] = 1; a[1] = 2; a[n_] := a[n] = a[n - 1] - (n - 1)*a[n - 2] Table[a[n], {n, 0, 30}]

CROSSREFS

Cf. A001503.

Sequence in context: A063707 A118287 A024930 this_sequence A021472 A053225 A050043

Adjacent sequences: A121963 A121964 A121965 this_sequence A121967 A121968 A121969

KEYWORD

sign

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research