



2, 5, 10, 17, 28, 40, 54, 70, 90, 111, 134, 159, 188, 218, 250, 284, 322, 361, 402, 445, 492, 540, 590, 642, 698, 755, 814, 875, 940, 1006, 1074, 1144, 1218, 1293, 1370, 1449, 1616, 1616, 1702, 1790, 1882, 1975, 2070, 2167, 2268, 2370, 2474, 2580, 2690, 2801
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Partial sums of numbers n such that iterated sum of digits of n is a prime; equivalently, partial sums of numbers n such that n modulo 9 is an element of {2,3,5,7}. The sequence seems sparse with primes at first, the subsequence of primes beginning: 2, 5, 17, 2801, and no others through a(54).


LINKS

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


FORMULA

a(n) = SUM[i=1..n] A028835(i).


CROSSREFS

Cf. A028835, A010888, A028834, A028843.
Sequence in context: A062493 A056871 A246883 * A301273 A007504 A172059
Adjacent sequences: A174907 A174908 A174909 * A174911 A174912 A174913


KEYWORD

base,easy,nonn


AUTHOR

Jonathan Vos Post, Apr 01 2010


STATUS

approved



