|
Search: id:A103114
|
|
|
| A103114 |
|
A modulo three sequential permutation the Fibonacci sequence distance between inner and outer. |
|
+0
1
|
|
| 1, 2, 1, 7, 0, 5, 19, 2, 23, 87, 0, 87, 377, 0, 379, 1599, 2, 1599, 6765, 2, 6765, 28657, 2, 28655, 121391, 2, 121393, 514231, 0, 514229, 2178307, 2, 2178311, 9227463, 0, 9227463, 39088169, 0, 39088171, 165580143, 2, 165580143, 701408733, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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) = Abs[f[fib[n]]-fib[f[n]]]
|
|
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[Abs[f[fib[n]] - fib[f[n]]], {n, 1, 200}]
|
|
CROSSREFS
|
Sequence in context: A101032 A025271 A100404 this_sequence A004561 A051258 A063704
Adjacent sequences: A103111 A103112 A103113 this_sequence A103115 A103116 A103117
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 16 2005
|
|
|
Search completed in 0.002 seconds
|
