|
|
A231153
|
|
Greatest integer k such that prime(n+1) + ... + prime(n+k) <= prime(1) + ... + prime(n).
|
|
3
|
|
|
1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 25, 25, 26
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,5
|
|
COMMENTS
|
a(n) is the greatest k such that 2*s(n) >= s(n+k), where s(n) is the n-th partial sum of primes.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
5 <= 2 + 3 < 5 + 7, so a(2) = 1.
19 + 23 <= 2 + 3 + 5 + 7 + 11 + 13 + 17 < 19 + 23 + 29, so a(7) = 2.
|
|
MATHEMATICA
|
test = 0; Table[test = test + Prime[n]; tmp = 0; NestWhile[# + 1 &, n, test >= (tmp = tmp + Prime[#]) &] - n, {n, 1, 80}] (* Peter J. C. Moses, Nov 02 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|