login

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”).

A081755
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.
0
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, 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, 2, 4, 2, 4, 2, 8, 4, 2, 4, 2
OFFSET
1,3
CROSSREFS
Cf. A060594.
Sequence in context: A377516 A069733 A187467 * A366538 A366536 A349355
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 08 2003
STATUS
approved