Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Mar 27 2020 13:05:03
%S 1,3,18,0,200,14,3364,0,0,88,9801,0,25281,116,1800,0,36992,0,4414201,
%T 0,196,2881,541696,0,0,711,0,0,98942809,209,1547536,0,19602,6901,
%U 814088,0,49042009,8473,1521,0,3150464641,377,245178368,0,0,6439,9265217536,0,0
%N Least x=a(n) such that product of common prime-divisors [without multiplicity] of sigma(x) and phi(x) equals n; or 0 if n is not a squarefree number or if no such x exists. Among indices n only squarefree numbers arise because multiplicity of prime factors is ignored.
%F a(n) = Min{x; A082055(x)=n}; 0 if n is not squarefree.
%e For n = 85: a(85) = 924800 = 128*5*5*17*17; sigma(924800) = 2426835 = 3*5*17*31*307; phi(924800) = 348160 = 4096*5*17; common prime factor 5.17 = 85.
%t ffi[x_] := Flatten[FactorInteger[x]]
%t lf[x_] := Length[FactorInteger[x]]
%t ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}]
%t t=Table[0, {100}]; Do[s=Apply[Times, Intersection
%t [ba[EulerPhi[n]], ba[DivisorSigma[1, n]]]];
%t If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 1000000}]; t
%Y Cf. A000203, A000010, A082054, A082055, A082056.
%Y Cf. A073815.
%K nonn
%O 1,2
%A _Labos Elemer_, Apr 03 2003
%E Corrected and extended by _David Wasserman_, Aug 27 2004