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”).
%I #3 Mar 30 2012 17:27:02
%S 3,2001907169
%N Primes p such that p^2 divides A048861((p-1)/2).
%C No other terms below 10^11.
%F 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).
%o (PARI) { forprime(p=3,10^11, if(Mod((p-1)/2,p^2)^((p-1)/2)==1, print(p);)) }
%Y A048861,A121999,A125854
%K bref,hard,more,nonn
%O 1,1
%A _Max Alekseyev_, Jan 18 2009
%E Edited by _Max Alekseyev_, Oct 13 2009