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

A260377
Primes p such that A001221(p-1)^(p-1) == 1 (mod p^2).
3
3, 5, 17, 257, 1093, 3511, 65537, 1006003
OFFSET
1,1
COMMENTS
No further terms up to 10^9.
All currently (as of 2015-07-23) known terms of A001220 and A019434 are in the sequence, as is A014127(2), but A014127(1) is not.
EXAMPLE
A001221(1092) == 4 and 4^1092 == 1 (mod 1093^2), so 1093 is a term of the sequence.
PROG
(PARI) forprime(p=1, 1e9, if(Mod(omega(p-1), p^2)^(p-1)==1, print1(p, ", ")))
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Felix Fröhlich, Jul 23 2015
STATUS
approved