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

A081754
Numbers n such that the number of noncongruent solutions to x^(2^m) == 1 (mod n) is the same for any m>=1.
2
1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 18, 19, 21, 22, 23, 24, 27, 28, 31, 33, 36, 38, 42, 43, 44, 46, 47, 49, 54, 56, 57, 59, 62, 63, 66, 67, 69, 71, 72, 76, 77, 79, 81, 83, 84, 86, 88, 92, 93, 94, 98, 99, 103, 107, 108, 114, 118, 121, 124, 126, 127, 129, 131, 132, 133, 134
OFFSET
1,2
COMMENTS
Numbers n such that the multiplicative group of residues modulo n does not contain C4 as a subgroup. Equivalently, numbers not divisible by 16 or by any primes of the form 4k+1. - Ivan Neretin, Aug 02 2016
From Jianing Song, Oct 18 2021: (Start)
Numbers k such that psi(k) = A002322(k) is not divisible by 4.
Numbers k such that there are an odd number of coprime squares modulo k, i.e., numbers k such that A046073(k) is odd. (End)
LINKS
Eric Weisstein's World of Mathematics, Modulo Multiplication Group.
MAPLE
filter:= n -> n mod 16 <> 0 and not member(1, numtheory:-factorset(n) mod 4):
select(filter, [$1..1000]); # Robert Israel, Aug 02 2016
MATHEMATICA
Select[Range@135, ! Divisible[#, 16] && FreeQ[Mod[FactorInteger[3 #][[All, 1]], 4], 1] &] (* Ivan Neretin, Aug 02 2016 *)
PROG
(PARI) isA081754(n) = if(n>2, znstar(n)[2][1]%4==2, 1) \\ Jianing Song, Oct 18 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 08 2003
STATUS
approved