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 A286540 #8 May 21 2017 14:32:46 %S A286540 2,2,6,6,2,2,2,2,2,2,2,2,2,2,6,2,2,2,2,2,1,1,1,3,8,2,2,2,2,2,2,2,2,2, %T A286540 2,2,2,2,2,2,2,2,6,2,2,2,2,2,6,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,6,2, %U A286540 2,6,2,2,6,2,2,2,2,2,2,2,6,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,6,2,2,8,8,24,18,2,2,2,2,2,2,2,6,2,2,2,2,2,2,6 %N A286540 a(n) = gcd(A259934(n), A259934(n-1)) = A009191(A259934(n)). %H A286540 Antti Karttunen, <a href="/A286540/b286540.txt">Table of n, a(n) for n = 1..64800</a> (computed from the b-file of A259934 provided by Robert Israel) %F A286540 a(n) = gcd(A259934(n), A259934(n-1)) = gcd(A259934(n), A259935(n)). %F A286540 a(n) = A009191(A259934(n)). %o A286540 (Scheme) %o A286540 (define (A286540 n) (gcd (A259934 n) (A259934 (- n 1)))) %o A286540 (define (A286540 n) (gcd (A259934 n) (A259935 n))) %Y A286540 Cf. A009191, A259934, A259935. %K A286540 nonn %O A286540 1,1 %A A286540 _Antti Karttunen_, May 21 2017