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 A049823 #4 Mar 30 2012 18:56:59 %S A049823 0,0,0,0,1,0,2,1,2,2,4,1,4,4,4,4,7,2,6,5,6,8,8,5,7,7,8,7,10,7,10,9,9, %T A049823 11,12,6,11,12,10,10,12,11,10,15,12,14,14,10,14,11,16,14,12,12,17,16, %U A049823 16,16,14,14,10,18,15,16,20,17,16,18,19,19 %N A049823 a(n)=number of 2's in n-th row of array T given by A049816. %e A049823 There are 4 numbers k from 1 to 11 for which the Euclidean algorithm on (11,k) has exactly 2 nonzero remainders; hence a(11)=4. %K A049823 nonn %O A049823 1,7 %A A049823 _Clark Kimberling_