|
Search: id:A066753
|
|
|
| A066753 |
|
a(n) = least natural number k such that n + sum_{1,...,k} Prime[i] is prime if such k exists; = 0 otherwise. |
|
+0
4
|
|
| 1, 2, 1, 20, 1, 2, 3, 2, 1, 10, 1, 2, 3, 2, 1, 16, 1, 2, 3, 4, 1, 10, 17, 2, 5, 2, 1, 10, 1, 4, 3, 2, 3, 10, 1, 2, 3, 2, 1, 16, 1, 2, 3, 4, 1, 18, 17, 2, 3, 4, 1, 10, 41, 2, 5, 2, 1, 16, 1, 6, 3, 2, 3, 10, 1, 2, 9, 2, 1, 10, 1, 4, 3, 2, 5, 16, 1, 2, 3, 4, 1, 10, 17, 2, 5, 4, 1, 20, 43, 4, 3, 2, 3, 10
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Does a(n) ever take 0 as a value?
|
|
EXAMPLE
|
20 + (2 + 3 + 5 + 7) = 37, a prime, and 4 consecutive primes starting with 2 are required to achieve this. So a(20) = 4.
|
|
MATHEMATICA
|
nt = 200; a = Table[0, {i, 1, nt}]; For[n = 1, n <= nt, n++, {i = 1; s = n + Prime[i]; While[Not[PrimeQ[s]] && (i < 1000), {i++; s = s + Prime[i]}]; a[[n]] = i}]; a
|
|
CROSSREFS
|
Adjacent sequences: A066750 A066751 A066752 this_sequence A066754 A066755 A066756
Sequence in context: A012901 A013021 A012907 this_sequence A103244 A012927 A013158
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 16 2002
|
|
EXTENSIONS
|
Edited by John W. Layman (layman(AT)math.vt.edu), Jan 23 2002
|
|
|
Search completed in 0.002 seconds
|
