A085052 Start with n and continue adding primes until one reaches a prime > n. Or, sequence gives n + P(k) where P(k)=sum_{k=1..n} prime(k) and k is the least value such that n + P(k) is prime and > n.

3, 7, 5, 643, 7, 11, 17, 13, 11, 139, 13, 17, 23, 19, 17, 397, 19, 23, 29, 37, 23, 151, 463, 29, 53, 31, 29, 157, 31, 47, 41, 37, 43, 163, 37, 41, 47, 43, 41, 421, 43, 47, 53, 61, 47, 547, 487, 53, 59, 67, 53, 181, 3319, 59, 83, 61, 59, 439, 61, 101, 71, 67, 73, 193, 67

Offset

1,1

Links

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

Example

a(6)=11: 6 + P(2)=11.

Prog

(PARI) p(n)=sum(k=1, n, prime(k)); a(m)=for(n=1, m, k=1; while(!isprime(n+p(k)), k++); print1(n+p(k)", "))

Crossrefs

Sequence in context: A107785 A277207 A001663 * A218363 A200611 A016666

Adjacent sequences: A085049 A085050 A085051 * A085053 A085054 A085055

Keyword

easy,nonn

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 26 2003

Extensions

Edited, corrected and extended by Jason Earls, Jun 28 2003

Status

approved