Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122018
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122018 Modulo 2 recursion switch between A000898 and A1211966: A000898 first. +0
1
1, 2, 6, 2, 40, 32, 464, 272, 7040, 4864, 136448, 87808, 3177472, 2123776, 86861824, 57128960, 2720112640, 1806049280, 96095928320, 63587041280, 3778819358720, 2507078533120, 163724570132480, 108568842403840, 7748467910901760 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = If[Mod[n, 2] == 1, a(n - 1) - (n - 1)* a(n - 2), 2*(a(n - 1) + (n - 1)*a(n - 2]))

MATHEMATICA

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

CROSSREFS

Cf. A000898, A121966.

Sequence in context: A140770 A141498 A144845 this_sequence A005729 A086660 A102068

Adjacent sequences: A122015 A122016 A122017 this_sequence A122019 A122020 A122021

KEYWORD

nonn,uned

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 11 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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research