A276197 Prime numbers p such that the sum of the first p odd primes is divisible by p.

2, 3, 73, 3420839

Offset

1,1

Comments

Primes in A097961. - Altug Alkan, Aug 24 2016

a(5) > 10^10. - Dana Jacobsen, Sep 29 2016

Links

Table of n, a(n) for n=1..4.

Example

a(2) = 3 since 3+5+7 = 15 is divisible by the prime number 3.

Prog

(PARI) a071148(n) = sum(k=2, n+1, prime(k))
isdivisible(n) = Mod(a071148(n), n)==0
terms(n) = my(i=0, p=2); while(i < n, if(isdivisible(p), print1(p, ", "); i++); p=nextprime(p+1))
/* The following function call prints the initial four terms */
terms(4) \\ Felix Fröhlich, Aug 24 2016
(Perl) use ntheory ":all"; my($s, $l, $pr)=(0, 0, prime_iterator(3)); forprimes { $s += $pr->() for $l+1 .. $_; $l=$_; say unless $s % $_; } 1e7; # Dana Jacobsen, Sep 23 2016

Crossrefs

Cf. A071148, A097961.

Sequence in context: A145531 A140546 A234237 * A042233 A176290 A371143

Adjacent sequences: A276194 A276195 A276196 * A276198 A276199 A276200

Keyword

nonn,hard,more

Author

G. L. Honaker, Jr., Aug 24 2016

Status

approved