OFFSET
1,1
COMMENTS
A generalization of A064413.
LINKS
Peter Kagey, Table of n, a(n) for n = 1..10000
PROG
(Python)
from math import gcd
def aupton(terms):
alst, aset = [12], {12}
for n in range(2, terms+1):
k = 2
while True:
while k in aset: k += 1
if gcd(alst[-1], k) != 1:
alst.append(k); aset.add(k); break
k += 1
return alst
print(aupton(73)) # Michael S. Branicky, Dec 02 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe and N. J. A. Sloane, Jun 02 2010
STATUS
approved