|
Search: id:A085052
|
|
|
| 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. |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(6)=11: 6 + P(2)=11.
|
|
PROGRAM
|
(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: A083778 A107785 A001663 this_sequence A016666 A065281 A019952
Adjacent sequences: A085049 A085050 A085051 this_sequence A085053 A085054 A085055
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 26 2003
|
|
EXTENSIONS
|
Edited, corrected and extended by Jason Earls (zevi_35711(AT)yahoo.com), Jun 28 2003
|
|
|
Search completed in 0.002 seconds
|
