|
%I #14 Oct 18 2019 23:05:39
%S 1,1,2,1,2,1,4,3,2,1,4,1,2,5,8,1,6,1,4,3,2,1,8,5,2,9,4,1,10,1,16,11,2,
%T 5,12,1,2,3,8,1,6,1,4,15,2,1,16,7,10,3,4,1,18,5,8,3,2,1,20,1,2,9,32,5,
%U 22,1,4,3,10,1,24,1,2,25,4,11,6,1,16,27,2,1,12,5,2,3,8,1,30,7,4,3,2,5,32,1
%N a(n) = gcd(n, A094457(n)).
%H Michael De Vlieger, <a href="/A094521/b094521.txt">Table of n, a(n) for n = 2..10000</a>
%e a(18) = gcd(18,12) = 6.
%t f[n_] := Block[{g, h}, g[x_] := Flatten[Table[#1, {#2}] & @@@ FactorInteger@ x]; h[x_] := If[x == 2, 1, NextPrime[x, -1]]; If[n == 1, 1, Max[Times @@ MapAt[h, g[n], #] & /@ Range[Length@ g[n]]]]]; Table[GCD[i, f@ i], {i, 2, 74}] (* _Michael De Vlieger_, Jan 31 2015 *)
%Y Cf. A094457 A094522.
%K easy,nonn
%O 2,3
%A _Marc LeBrun_, May 06 2004
|
