|
Search: id:A111141
|
|
|
| A111141 |
|
GCD(F(n),A113222(n)), where F(n) is n-th Fibonacci number. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,3
|
|
|
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: A030335 A030790 A001578 this_sequence A094122 A082117 A011157
Adjacent sequences: A111138 A111139 A111140 this_sequence A111142 A111143 A111144
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Oct 18 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 21 2005
|
|
|
Search completed in 0.002 seconds
|
