|
%I #2 Mar 30 2012 17:30:38
%S 0,1,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,3,2,17,2,3,2,3,
%T 2,5,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,13,2,3,2,3,2,5,2,3,
%U 2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,3
%N Least factor of n^Phi(n) -1.
%C n^Phi(n)-1 is never prime. This sequence is an outgrowth of Euler's generalization to Fermat's little theorem.
%t a = {}; Do[ a = Append[a, FactorInteger[ n^EulerPhi[n] - 1, FactorComplete -> False][[1, 1]]], {n, 1, 100}]; a
%Y Cf. A066699.
%K nonn
%O 1,3
%A _Robert G. Wilson v_, Jan 15 2002
|
