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 A218535 #9 Aug 19 2022 12:27:06 %S A218535 1,2,3,3,4,4,5,5,15,9,3,5,5,25,35,14,7,7,8,4,7,7,7,14,42,42,30,18,8, %T A218535 16,20,10,25,45,27,27,33,11,11,11,33,33,33,24,6,9,9,12,15,15,21,21,42, %U A218535 66,36,108,117,13,65,91,91,91,13,13,39,33,22,22,11,13 %N A218535 Greatest common divisor of consecutive terms in A176352. %C A218535 a(n) = gcd(A176352(n),A176352(n+1)). %H A218535 Reinhard Zumkeller, <a href="/A218535/b218535.txt">Table of n, a(n) for n = 1..10000</a> %o A218535 (Haskell) %o A218535 import Data.Ratio ((%), numerator, denominator) %o A218535 a218535 n = a218535_list !! (n-1) %o A218535 a218535_list = zipWith gcd a176352_list $ tail a176352_list %o A218535 -- . %Y A218535 Cf. A176352, A218533, A218534. %K A218535 nonn %O A218535 1,2 %A A218535 _Reinhard Zumkeller_, Nov 10 2012