OFFSET
1,2
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
EXAMPLE
n = 1 is not prime, k = 1 results in first partial sum 1 divisible by 1 as required, so a(1) = 1.
n = 2 is prime, k = 1 results in second partial sum 2 divisible by 2 and is excluded, but k = 2 results in second partial sum 3 not divisible by 2 as required, so a(2) = 2.
PROG
(PARI) {m=105; s=0; for(n=1, m, k=1; if(isprime(n), while((s+k)%n==0, k++), while((s+k)%n>0, k++)); print1(k, ", "); s=s+k)}
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jun 17 2004
EXTENSIONS
Edited and extended by Klaus Brockhaus, Jun 19 2004
STATUS
approved