This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A169851 #13 Oct 02 2021 11:06:15 %S A169851 10,2,4,6,3,9,12,8,14,7,21,15,5,20,16,18,22,11,33,24,26,13,39,27,30, %T A169851 25,35,28,32,34,17,51,36,38,19,57,42,40,44,46,23,69,45,48,50,52,54,56, %U A169851 49,63,60,55,65,70,58,29,87,66,62,31,93,72,64,68,74,37,111,75,78,76,80,82,41 %N A169851 EKG sequence started at 10 instead of 2. %C A169851 A generalization of A064413. %H A169851 Peter Kagey, <a href="/A169851/b169851.txt">Table of n, a(n) for n = 1..10000</a> %o A169851 (Python) %o A169851 from math import gcd %o A169851 def aupton(terms): %o A169851 alst, aset = [1, 10], {1, 10} %o A169851 for n in range(2, terms+1): %o A169851 k = 2 %o A169851 while True: %o A169851 while k in aset: k += 1 %o A169851 if gcd(alst[-1], k) != 1: alst.append(k); aset.add(k); break %o A169851 k += 1 %o A169851 return alst[1:] %o A169851 print(aupton(73)) # _Michael S. Branicky_, Oct 02 2021 %Y A169851 For other initial terms, see A064413, A169837, A169839, A169841, A169843, A169845, A169847, A169849, A169853, A169855. %Y A169851 Cf. A169852. %K A169851 nonn %O A169851 1,1 %A A169851 _T. D. Noe_ and _N. J. A. Sloane_, Jun 02 2010