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 A182620 #16 Feb 03 2019 17:16:20 %S A182620 1,1,10,1,11,1,10,100,1,101,1,10,11,110,1,111,1,10,100,1000,1,11,1001, %T A182620 1,10,101,1010,1,1011,1,10,11,100,110,1100,1,1101,1,10,111,1110,1,11, %U A182620 101,1111,1,10,100,1000,10000,1,10001,1,10,11 %N A182620 Triangle T(n,k) read by rows in which row n lists the divisors of n, written in base 2. %C A182620 Numbers of triangle A027750, written in base 2. %H A182620 Nathaniel Johnston, <a href="/A182620/b182620.txt">Table of n, a(n) for n = 1..7069</a> %F A182620 T(n,k) = A007088(A027750(n,k)). %e A182620 The divisors of 10 are 1, 2, 5, 10 then row 10 lists the binary numbers 1, 10, 101, 1010. %e A182620 Triangle begins: %e A182620 1, %e A182620 1, 10, %e A182620 1, 11, %e A182620 1, 10, 100, %e A182620 1, 101, %e A182620 1, 10, 11, 110, %e A182620 1, 111, %e A182620 1, 10, 100, 1000, %e A182620 1, 11, 1001, %e A182620 1, 10, 101, 1010, %e A182620 1, 1011, %e A182620 1, 10, 11, 100, 110, 1100, %p A182620 with(numtheory):for n from 1 to 10 do for d in divisors(n) do printf("%d, ",convert(d,binary)); od:printf("\n");od: # _Nathaniel Johnston_, Apr 19 2011 %t A182620 Table[FromDigits[IntegerDigits[#,2]]&/@Divisors[n],{n,20}]//Flatten (* _Harvey P. Dale_, May 31 2018 *) %Y A182620 Cf. A007088, A027750, A182621, A182622, A182623, A182624, A182630. %K A182620 nonn,easy,tabf,base %O A182620 1,3 %A A182620 _Omar E. Pol_, Nov 22 2010 %E A182620 a(38)-a(55) from _Nathaniel Johnston_, Apr 19 2011