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

A154998
Primes p such that p^2 divides A048861((p-1)/2).
1
3, 2001907169
OFFSET
1,1
COMMENTS
No other terms below 10^11.
FORMULA
Elements of A125854 congruent to 1 or 3 modulo 8, i.e., primes p such that p == 1 or 3 (mod 8) and 2^(p-1) == 1+p (mod p^2).
PROG
(PARI) { forprime(p=3, 10^11, if(Mod((p-1)/2, p^2)^((p-1)/2)==1, print(p); )) }
CROSSREFS
KEYWORD
bref,hard,more,nonn
AUTHOR
Max Alekseyev, Jan 18 2009
EXTENSIONS
Edited by Max Alekseyev, Oct 13 2009
STATUS
approved