login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137258 Primes p that satisfy s-t < 0 where s = sigma(2*p+1) mod phi(p) and t = sigma(2*p+1) mod p. 0

%I #6 Feb 15 2013 05:08:20

%S 3,5,7,17,19,139,157,577,1201,27361,530401,2513281,7183201,407817217

%N Primes p that satisfy s-t < 0 where s = sigma(2*p+1) mod phi(p) and t = sigma(2*p+1) mod p.

%C The function sigma(n) is the sum of positive divisors function and the function phi(n) is the Euler totient function.

%C The positive values of s-t for primes p<2000 are 0, 2, 3, 4.

%C a(15) > 2*10^9. - _Donovan Johnson_, Feb 15 2013

%o (PARI) p=1; for(i=1, 10^9, p=nextprime(p+1); s=sigma(2*p+1); if(s%(p-1)<s%p, print(p))) /* _Donovan Johnson_, Feb 15 2013 */

%K nonn,more

%O 1,1

%A Juan Lopez Gonzalez (juan.lopezg(AT)estudiante.uam.es), Apr 25 2008

%E a(10)-a(12) added by _R. J. Mathar_, May 23 2008

%E a(13)-a(14) from _Donovan Johnson_, Feb 15 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)