login
This site is supported by donations 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; internal format)
OFFSET

1,5

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: A126853 A201654 A132199 * A179626 A174965 A159671

Adjacent sequences:  A111139 A111140 A111141 * A111143 A111144 A111145

KEYWORD

nonn

AUTHOR

Leroy Quet Oct 18 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 21 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.