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!)
A142337 Numbers n such that sum(i=1..n, sigma(i)) is prime. 0
7, 12, 18, 23, 24, 32, 49, 66, 84, 87, 90, 92, 111, 112, 113, 114, 129, 130, 132, 133, 137, 138, 199, 238, 239, 271, 275, 278, 283, 285, 307, 313, 314, 317, 319, 322, 340, 342, 352, 357, 392, 394, 397, 399, 442, 443, 491, 492, 494, 499, 500, 505, 507, 508, 541, 545, 551, 552, 573, 574, 589, 590, 597, 598, 599, 600, 610, 619, 622, 648, 649, 650 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Numbers n such that A024916(n) is prime.
LINKS
MATHEMATICA
Flatten[Table[If[PrimeQ[Sum[DivisorSigma[1, i], {i, 1, n}]], n, {}], {n, 1, 300}]].
Position[Accumulate[DivisorSigma[1, Range[650]]], _?PrimeQ]//Flatten (* Harvey P. Dale, Oct 12 2020 *)
PROG
(PARI) t=0; for(n=1, 1e3, if(isprime(t+=sigma(n)), print1(n", "))) \\ Charles R Greathouse IV, Nov 07 2011
(Python)
from itertools import count, islice
from math import isqrt
from sympy import isprime
def A142337_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda n: isprime(-(s:=isqrt(n))**2*(s+1) + sum((q:=n//k)*((k<<1)+q+1) for k in range(1, s+1))>>1), count(max(startvalue, 1)))
A142337_list = list(islice(A142337_gen(), 30)) # Chai Wah Wu, Oct 23 2023
CROSSREFS
Cf. A024916.
Sequence in context: A092094 A064665 A369357 * A131912 A247159 A022953
KEYWORD
nonn
AUTHOR
EXTENSIONS
Corrected and extended by Harvey P. Dale, Oct 12 2020
STATUS
approved

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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)