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 #6 Mar 30 2012 18:39:16
%S 1,1,2,2,2,2,4,2,2,4,2,2,2,4,2,2,8,2,4,2,4,4,2,4,2,4,2,2,2,2,8,4,2,2,
%T 4,4,2,4,2,8,4,4,2,2,2,8,2,8,4,4,2,2,4,2,2,4,4,2,2,4,4,2,4,2,8,4,2,4,
%U 2,4,2,4,2,8,4,2,4,2
%N Number of noncongruent solutions to x^(2^m) == 1 (mod n) when n is such that the number of solutions is the same for any m>=1.
%Y Cf. A060594.
%K nonn
%O 1,3
%A _Benoit Cloitre_, Apr 08 2003