[go: up one dir, main page]

login

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”).

Revision History for A259035 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
#4 by Alois P. Heinz at Wed Jun 17 09:14:31 EDT 2015
STATUS

proposed

approved

#3 by Michel Marcus at Wed Jun 17 08:47:28 EDT 2015
STATUS

editing

proposed

#2 by Michel Marcus at Wed Jun 17 04:59:12 EDT 2015
NAME

allocated for Michel MarcusPartial sums of A073602.

DATA

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

OFFSET

1,1

COMMENTS

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

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
KEYWORD

allocated

nonn

AUTHOR

Michel Marcus, Jun 17 2015

STATUS

approved

editing

Discussion
Wed Jun 17
08:47
Michel Marcus: Or cumulative sums ?
#1 by Michel Marcus at Wed Jun 17 04:59:12 EDT 2015
NAME

allocated for Michel Marcus

KEYWORD

allocated

STATUS

approved