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!)
A111142 GCD(n,A113222(n)). 0
1, 1, 1, 1, 5, 3, 1, 1, 1, 2, 1, 1, 1, 14, 1, 1, 1, 1, 1, 4, 3, 2, 1, 1, 25, 26, 1, 4, 1, 2, 1, 1, 1, 34, 1, 1, 1, 2, 1, 2, 1, 2, 1, 4, 3, 46, 1, 1, 1, 2, 3, 4, 1, 3, 1, 2, 1, 2, 1, 10, 1, 2, 1, 1, 1, 2, 1, 4, 3, 1, 1, 1, 1, 74, 3, 4, 1, 2, 1, 16, 1, 2, 1, 6, 1, 86, 1, 22, 1, 10, 1, 4, 3, 94, 1, 1, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
EXAMPLE
12 = 2^2 * 3^1. So a(12) = GCD(12, F(2^2) + F(3^1)) = GCD(12, 5) = 1.
MATHEMATICA
f[n_] := GCD[n, Plus @@ (Fibonacci[ #[[1]]^#[[2]]] & /@ FactorInteger[n])]; Table[ f[n], {n, 99}] (* Robert G. Wilson v *)
CROSSREFS
Cf. A113222.
Sequence in context: A265606 A368602 A132199 * A179626 A174965 A159671
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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)