login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

GCD(F(n),A113222(n)), where F(n) is n-th Fibonacci number.
0

%I #8 Apr 09 2014 10:16:30

%S 1,1,2,3,5,1,13,21,34,1,89,1,233,1,1,987,1597,1,4181,1,1,1,28657,23,

%T 75025,1,196418,1,514229,8,1346269,2178309,1,1,1,1,24157817,1,1,1,

%U 165580141,8,433494437,1,1,1,2971215073,23,7778742049,1,1,1,53316291173

%N GCD(F(n),A113222(n)), where F(n) is n-th Fibonacci number.

%e 12 = 2^2 * 3^1. So a(12) = GCD(F(12),F(2^2) + F(3^1)) = GCD(144, 5) = 1.

%t f[n_] := GCD[ Fibonacci[n], Plus @@ (Fibonacci[ #[[1]]^#[[2]]] & /@ FactorInteger[n])]; Table[ f[n], {n, 53}] (* _Robert G. Wilson v_ *)

%Y Cf. A113222.

%K nonn

%O 1,3

%A _Leroy Quet_, Oct 18 2005

%E More terms from _Robert G. Wilson v_, Oct 21 2005