OFFSET
1,2
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Zak Seidov)
MATHEMATICA
k = 0; Table[p = Prime[n]; k++; first = k; sm = 0; While[sm = sm + k; Mod[sm, p] > 0, k++]; first, {n, 50}] (* T. D. Noe, Mar 19 2014 *)
PROG
(Python)
from itertools import count
from sympy import prime, primerange
def aupton(terms):
alst, naturals = [], count(1)
for p in primerange(1, prime(terms)+1):
s = start = next(naturals)
while s%p: s += next(naturals)
alst.append(start)
return alst
print(aupton(52)) # Michael S. Branicky, Jun 09 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jul 28 2003
EXTENSIONS
More terms from Ray Chandler and Gabriel Cunningham (gcasey(AT)mit.edu), Sep 16 2003
STATUS
approved