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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111141 GCD(F(n),A113222(n)), where F(n) is n-th Fibonacci number. 0
1, 1, 2, 3, 5, 1, 13, 21, 34, 1, 89, 1, 233, 1, 1, 987, 1597, 1, 4181, 1, 1, 1, 28657, 23, 75025, 1, 196418, 1, 514229, 8, 1346269, 2178309, 1, 1, 1, 1, 24157817, 1, 1, 1, 165580141, 8, 433494437, 1, 1, 1, 2971215073, 23, 7778742049, 1, 1, 1, 53316291173 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
12 = 2^2 * 3^1. So a(12) = GCD(F(12),F(2^2) + F(3^1)) = GCD(144, 5) = 1.
MATHEMATICA
f[n_] := GCD[ Fibonacci[n], Plus @@ (Fibonacci[ #[[1]]^#[[2]]] & /@ FactorInteger[n])]; Table[ f[n], {n, 53}] (* Robert G. Wilson v *)
CROSSREFS
Cf. A113222.
Sequence in context: A001578 A262341 A178763 * A069111 A171035 A094122
KEYWORD
nonn
AUTHOR
Leroy Quet, Oct 18 2005
EXTENSIONS
More terms from Robert G. Wilson v, Oct 21 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 13:14 EDT 2024. Contains 372019 sequences. (Running on oeis4.)