login
Greatest common divisor of squarefree kernel of n and sum of squarefree kernels of numbers <= n.
1

%I #4 Mar 30 2012 18:50:25

%S 1,1,3,2,1,1,1,2,1,1,1,2,1,1,5,2,17,1,1,2,7,1,1,2,1,1,1,2,1,3,1,2,3,1,

%T 1,6,1,1,3,2,1,3,1,2,1,1,1,2,1,1,1,2,53,1,1,2,1,1,1,2,1,1,1,2,1,3,1,2,

%U 1,1,1,2,1,1,1,2,1,3,1,2,1,1,1,14,1,1,1,2,1,1,7,2,1,1,1,2,1,1,1,2,1,1

%N Greatest common divisor of squarefree kernel of n and sum of squarefree kernels of numbers <= n.

%C a(n) = GCD(A007947(n), A073355(n)).

%K nonn

%O 1,3

%A _Reinhard Zumkeller_, Jul 29 2002