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 A255481 #12 Mar 10 2015 18:07:20 %S A255481 1,1,1,2,2,1,1,2,1,1,1,1,1,3,1,1,1,1,3,1,1,2,1,1,1,1,2,2,1,1,1,1,1,2, %T A255481 2,2,1,1,1,1,1,1,1,3,1,2,2,2,2,1,1,1,3,3,1,1,1,1,1,1,1,2,2,2,2,1,1,3, %U A255481 3,3,2,1,1,2,2,2,1,1,1,1,1,3,1,2,2,1,1,1,1,1,1,1,1 %N A255481 a(n) = gcd(b(n),b(n-1)), where b(n) = A255582(n). %C A255481 By definition, a(n) <= A255480(n) for n >= 4. %H A255481 Ray Chandler, <a href="/A255481/b255481.txt">Table of n, a(n) for n = 2..10001</a> %o A255481 (Haskell) %o A255481 a255481 n = a255481_list !! (n-1) %o A255481 a255481_list = zipWith gcd a255582_list $ tail a255582_list %o A255481 -- _Reinhard Zumkeller_, Mar 10 2015 %Y A255481 Cf. A255582, A255480, A255479. %K A255481 nonn %O A255481 2,4 %A A255481 _N. J. A. Sloane_, Feb 28 2015