reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
f[n_] := Module[{F, V}, F = Power @@@ FactorInteger[n]; V = {F[[1]]}; Do[V = {# + F[[i]], # - F[[i]]}& /@ V // Flatten, {i, 2, Length[F]}]; V // Abs // Min];
f[1] = 0;
Array[f, 100] (* Jean-François Alcover, Aug 28 2020, after Robert Israel *)
approved
editing
proposed
approved
editing
proposed
Robert Israel, <a href="/A140523/b140523.txt">Table of n, a(n) for n = 1..10000</a>
f:= proc(n) local F, V, i;
F:= map(t -> t[1]^t[2], ifactors(n)[2]);
V:= {F[1]};
for i from 2 to nops(F) do
V:= map(t -> (t+F[i], t-F[i]), V);
od:
min(map(abs, V))
end proc:
f(1):= 0:
map(f, [$1..100]); # Robert Israel, Sep 12 2018
approved
editing
Leroy Quet , Jul 02 2008
_Leroy Quet _ Jul 02 2008
Extended by _Ray Chandler (rayjchandler(AT)sbcglobal.net), _, Jun 25 2009