|
Search: id:A122578
|
|
|
| A122578 |
|
A switch between two types of n level recursion: Even:a(n)=(n - 1)*a(n - 1) - a(n - 2) Odd:a(n)=a(n - 1) - (n - 2)*a(n - 2). |
|
+0
1
|
|
| 1, 2, 1, -1, -4, -1, -1, 4, 29, 1, -20, -29, -299, 20, 559, 299, 3926, -559, -13429, -3926, -61165, 13429, 343174, 61165, 1063621, -343174, -9642971, -1063621, -19074796, 9642971, 298720955, 19074796, 292597721, -298720955, -10150389236, -292597721, -90530999, 10150389236, 375654932731
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Even:a(n)=(n - 1)*a(n - 1) - a(n - 2) Odd:a(n)=a(n - 1) - (n - 2)*a(n - 2)
|
|
MATHEMATICA
|
a[0] = 1; a[1] = 2; a[n_] := a[n] = If[Mod[n, 2] == 0, (n - 1)*a[n - 1] - a[n - 2], a[n - 1] - (n -2)*a[n - 2]] Table[a[n], {n, 0, 50}]
|
|
CROSSREFS
|
Sequence in context: A099238 A141450 A061462 this_sequence A005131 A105477 A127709
Adjacent sequences: A122575 A122576 A122577 this_sequence A122579 A122580 A122581
|
|
KEYWORD
|
sign,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 17 2006
|
|
|
Search completed in 0.002 seconds
|
