|
Search: id:A102875
|
|
|
| A102875 |
|
Let f(n) = n+2 if n == 1 mod 3, = n if n == 2 mod 3, = n-2 if n == 0 mod 3; then a(n) = Fibonacci(f(n)). |
|
+0
1
|
|
| 0, 2, 1, 1, 8, 5, 3, 34, 21, 13, 144, 89, 55, 610, 377, 233, 2584, 1597, 987, 10946, 6765, 4181, 46368, 28657, 17711, 196418, 121393, 75025, 832040, 514229, 317811, 3524578, 2178309, 1346269, 14930352, 9227465, 5702887, 63245986, 39088169
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
In other words, split the Fibonacci numbers into groups of three and reverse each group.
|
|
MATHEMATICA
|
fib[n_Integer?Positive] := fib[n] = fib[n - 1] + fib[n - 2] fib[0] = 0; fib[1] = 1 f[n_] = If[Mod[n, 3] == 1, n + 2, If[Mod[n, 3] == 0, n - 2, n]] a = Table[fib[f[n]], {n, 1, 200}]
|
|
CROSSREFS
|
Adjacent sequences: A102872 A102873 A102874 this_sequence A102876 A102877 A102878
Sequence in context: A119418 A077058 A053373 this_sequence A021476 A051428 A129276
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 16 2005
|
|
EXTENSIONS
|
Edited by njas, Nov 12 2006
|
|
|
Search completed in 0.002 seconds
|
