The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A259035 revision #3

A259035

Partial sums of A073602.

2, 9, 20, 49, 66, 169, 306, 437, 460, 609, 682, 999, 1066, 1247, 1410, 1537, 1770, 2257, 2814, 2911, 3504, 3871, 3984, 4183, 5432, 7575, 7622, 8239, 8502, 9379, 9398, 10611, 10960, 11537, 11920, 12231, 12874, 12877, 14028, 14359, 15036, 17557, 17954, 19107, 20488

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

By definition of A073602, a(n) is divisible by prime(n).

LINKS

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

FORMULA

a(n) = A258052(n)*prime(n).

PROG

(PARI) vsearch(n, v)=local(j, s); j=1; s=matsize(v)[2]; while(j<=s&&n!=v[j], j++); j<=s;

{m=54; v=[]; n=1; while(n<=m, p=2; while(vsearch(p, v)||((sum(j=1, matsize(v)[2], v[j])+p)%prime(n))>0, p=nextprime(p+1)); v=concat(v, p); n++); for (i=1, #v, print1(sum(k=1, i, v[k]), ", ")); } \\ adapted from A073602

CROSSREFS

Cf. A073602, A258052.

Sequence in context: A294540 A248435 A272211 * A093835 A264294 A280295

Adjacent sequences: A259032 A259033 A259034 * A259036 A259037 A259038

KEYWORD

nonn

AUTHOR

Michel Marcus, Jun 17 2015

STATUS

proposed