The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A103114 a(n) = abs( f(Fibonacci(n)) - Fibonacci(f(n)) ), where f(n) = n-2 if (n mod 3) = 0, f(n) = n+2 if (n mod 3) = 1, otherwise f(n) = n. 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; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 FORMULA a(n) = abs( f(Fibonacci(n)) - Fibonacci(f(n)) ), where f(n) = n-2 if (n mod 3) = 0, f(n) = n+2 if (n mod 3) = 1, otherwise f(n) = n; or f(n) = - f(n-1) - f(n-2) + 3*(n-1), with f(1) = 3 and f(2) = 2. MATHEMATICA f[n_]= If[Mod[n, 3]==0, n-2, If[Mod[n, 3]==1, n+2, n]]; a[n_]:= Abs[f[Fibonacci[n]] - Fibonacci[f[n]]]; Table[a[n], {n, 50}] PROG (Magma) f:= func< n | n mod 3 eq 0 select n-2 else n mod 3 eq 1 select n+2 else n >; A103114:= func< n | Abs( f(Fibonacci(n)) - Fibonacci(f(n)) ) >; [A103114(n): n in [1..60]]; // G. C. Greubel, Dec 06 2022 (SageMath) def f(n): if (n%3)==0: return n-2 elif (n%3)==1: return n+2 else: return n def A103114(n): return abs( f(fibonacci(n)) - fibonacci(f(n)) ) [A103114(n) for n in range(1, 60)] # G. C. Greubel, Dec 06 2022 CROSSREFS Sequence in context: A300911 A347899 A365750 * A004561 A255984 A199458 Adjacent sequences: A103111 A103112 A103113 * A103115 A103116 A103117 KEYWORD nonn,easy,less AUTHOR Roger L. Bagula, Mar 16 2005 EXTENSIONS Edited by G. C. Greubel, Dec 06 2022 STATUS approved

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

Last modified March 3 03:04 EST 2024. Contains 370499 sequences. (Running on oeis4.)