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 A251102 #11 Aug 01 2019 03:47:52 %S A251102 1,2,3,4,3,2,5,2,5,6,5,4,7,2,7,10,3,2,3,11,13,11,13,3,2,3,4,17,2,17,6, %T A251102 5,2,5,2,13,6,7,2,7,19,21,19,2,19,4,3,10,23,2,23,4,5,2,3,2,3,2,29,31, %U A251102 29,31,2,3,4,11,2,7,6,7,6,7,6,7,2,35,37,35 %N A251102 a(n) = gcd(A098550(n+2), A098550(n)). %C A251102 For n > 1: a(n) > 1, by definition of A098550; %C A251102 gcd(a(n+1), a(n)) = 1; %C A251102 gcd(a(n), A098550(n)) = a(n). %H A251102 Reinhard Zumkeller, <a href="/A251102/b251102.txt">Table of n, a(n) for n = 1..10000</a> %o A251102 (Haskell) %o A251102 a251102 n = a251102_list !! (n-1) %o A251102 a251102_list = zipWith gcd (drop 2 a098550_list) a098550_list %Y A251102 Cf. A098550, A253581. %K A251102 nonn %O A251102 1,2 %A A251102 _Reinhard Zumkeller_, Nov 30 2014