login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102905 A modulo three sequential permutation the Fibonacci sequence (outer): permutation after the Fibonacci. 0
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; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..38.

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]]

Empirical G.f.: x*(2*x^9-x^8-4*x^7+2*x^6+2*x^5+2*x^4-4*x^3-4*x^2+3) / ((x-1)*(x+1)*(x^2+1)*(x^2+x-1)*(x^4+1)). [Colin Barker, Dec 11 2012]

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: A080993 A140259 A175644 * A020862 A131589 A309119

Adjacent sequences:  A102902 A102903 A102904 * A102906 A102907 A102908

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula, Mar 16 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 13:32 EDT 2019. Contains 328093 sequences. (Running on oeis4.)