|
%I #12 Dec 03 2021 04:48:03
%S 1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,4,1,1,1,1,1,1,1,2,1,1,3,1,1,1,1,8,1,1,
%T 1,1,1,1,1,2,1,1,1,1,1,1,1,4,1,1,1,1,1,3,1,2,1,1,1,1,1,1,1,16,1,1,1,1,
%U 1,1,1,2,1,1,1,1,1,1,1,4,9,1,1,1,1,1,1,2,1,3,1,1,1,1,1,8,1,1,1,1,1,1,1,2
%N a(n) = A073752(A073752(n)), where A073752(n) = gcd(n/spf(n), n/gpf(n)), with spf(n) as the smallest and gpf(n) as the greatest prime factor of n (see A020639, A006530).
%C a(n) = A062378(n) for n<90, but a(90)=3 <> A062378(90)=1.
%H Antti Karttunen, <a href="/A073753/b073753.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A073752(A073752(n)).
%t A073752[n_] := With[{f = FactorInteger[n][[All, 1]]}, GCD[n/f[[1]], n/f[[-1]]]];
%t a[n_] := A073752[A073752[n]];
%t Array[a, 100] (* _Jean-François Alcover_, Dec 03 2021 *)
%Y Cf. A006530, A020639, A073752.
%Y Differs from A062378 for the first time at n=90.
%K nonn
%O 1,8
%A _Reinhard Zumkeller_, Aug 07 2002
%E Name edited by _Antti Karttunen_, Sep 23 2017
|
