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

A254329
Numbers n such that all x^2 mod n are prime powers (including 0 and 1).
1
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 16, 20, 32
OFFSET
1,2
MATHEMATICA
f[n_] := Mod[Range[n]^2, n]; Select[Range@ 10000, AllTrue[f@ #, Length@ FactorInteger[#] == 1 &] &] (* AllTrue function introduced with Version 10; Michael De Vlieger, Jan 29 2015 *)
PROG
(PARI) is(n)=for(i=2, 9, if(!isprimepower(i^2%n) && i^2%n>1, return(0))); 1 \\ Charles R Greathouse IV, Jan 30 2015
CROSSREFS
Sequence in context: A252996 A252495 A182175 * A128870 A355620 A256476
KEYWORD
nonn,fini,full
AUTHOR
Joerg Arndt, Jan 28 2015
STATUS
approved