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 A049824 #6 Aug 25 2022 11:33:37 %S A049824 0,0,0,0,0,0,0,1,0,0,2,1,1,2,1,2,4,2,4,3,0,4,8,5,3,5,6,5,7,3,6,9,7,8, %T A049824 9,6,8,12,9,8,9,7,12,11,5,12,18,12,10,9,11,12,17,16,12,14,10,18,22,12, %U A049824 11,16,11,16 %N A049824 a(n) = number of 3's in n-th row of array T given by A049816. %e A049824 There are 2 numbers k from 1 to 11 for which the Euclidean algorithm on (11,k) has exactly 3 nonzero remainders; hence a(11)=2. %Y A049824 Cf. A049816. %K A049824 nonn %O A049824 1,11 %A A049824 _Clark Kimberling_