|
Search: id:A102905
|
|
|
| A102905 |
|
A modulo three sequential permutation the Fibonacci sequence ( outer): permutation after the Fibonacci. |
|
+0
1
|
|
| 3, 3, 2, 1, 5, 8, 15, 19, 36, 57, 89, 142, 233, 377, 612, 985, 1599, 2586, 4181, 6763, 10946, 17711, 28659, 46366, 75027, 121395, 196418, 317809, 514229, 832040, 1346271, 2178307, 3524580, 5702889, 9227465, 14930350, 24157817, 39088169
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
f[n]=If mod(n, 3)=1 then n+2 f[n]=If mod(n, 3)=2 then n f[n]=If mod(n, 3)=1 then n-2 fib[n]=fib[n-1]+fib[n-2] a(n) = f[fib[n-1]+fib[n-2]]
|
|
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[f[fib[n]], {n, 1, 200}]
|
|
CROSSREFS
|
Sequence in context: A038766 A080993 A140259 this_sequence A020862 A131589 A064983
Adjacent sequences: A102902 A102903 A102904 this_sequence A102906 A102907 A102908
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 16 2005
|
|
|
Search completed in 0.002 seconds
|
