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 A182628 #10 Feb 03 2019 17:15:47
%S A182628 1,1,2,1,2,1,2,3,1,3,1,2,2,3,1,3,1,2,3,4,1,2,4,1,2,3,4,1,4,1,2,2,3,3,
%T A182628 4,1,4,1,2,3,4,1,2,3,4,1,2,3,4,5,1,5,1,2,2,3,4,5,1,5,1,2,3,3,4,5,1,2,
%U A182628 3,5,1,2,4,5,1,5,1,2,2
%N A182628 Triangle T(n,k) read by rows in which row n lists the number of digits of the binary expansion of the divisors of n.
%C A182628 Row n lists the number of digits of the numbers in the n-th row of triangle A182620.
%H A182628 Nathaniel Johnston, <a href="/A182628/b182628.txt">Table of n, a(n) for n = 1..10000</a>
%e A182628 Triangle begins:
%e A182628 1,
%e A182628 1, 2,
%e A182628 1, 2,
%e A182628 1, 2, 3,
%e A182628 1, 3,
%e A182628 1, 2, 2, 3,
%e A182628 1, 3,
%e A182628 1, 2, 3, 4,
%e A182628 1, 2, 4,
%e A182628 1, 2, 3, 4,
%e A182628 1, 4,
%e A182628 1, 2, 2, 3, 3, 4,
%p A182628 with(numtheory):for n from 1 to 12 do for d in divisors(n) do printf("%d, ",length(convert(convert(d, binary),string))); od:printf("\n"); od: # _Nathaniel Johnston_, Apr 19 2011
%Y A182628 Cf. A182620, A182621, A182622.
%Y A182628 Row sums give A182627.
%K A182628 nonn,base,easy,tabf
%O A182628 1,3
%A A182628 _Omar E. Pol_, Nov 23 2010
%E A182628 a(38)-a(79) from _Nathaniel Johnston_, Apr 19 2011