Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122048 A alternating n-th level recursion: a(n) = (n - 2)*a(n - 2) - a(n - 3). +0
1
0, 1, 2, 1, 3, 1, 11, 2, 65, 3, 518, -38, 5177, -936, 62162, -17345, 871204, -322337, 13956609, -6350933, 251541299, -134624336, 5037176913, -3078652355, 110952516422, -75846181078, 2665939046483, -2007107043372, 69390261389636, -56857829217527, 1944934425953180 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n) = (n - 2)*a(n - 2) - a(n - 3)

MATHEMATICA

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

CROSSREFS

Cf. A122021.

Sequence in context: A126761 A090559 A098570 this_sequence A046208 A006241 A137764

Adjacent sequences: A122045 A122046 A122047 this_sequence A122049 A122050 A122051

KEYWORD

sign

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 13 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research