reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
(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
approved
editing
editing
approved
A generalization of A064413.
proposed
editing
editing
proposed
A generalization of A064413.
proposed
editing
editing
proposed