Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Feb 03 2019 17:16:20
%S 1,1,10,1,11,1,10,100,1,101,1,10,11,110,1,111,1,10,100,1000,1,11,1001,
%T 1,10,101,1010,1,1011,1,10,11,100,110,1100,1,1101,1,10,111,1110,1,11,
%U 101,1111,1,10,100,1000,10000,1,10001,1,10,11
%N Triangle T(n,k) read by rows in which row n lists the divisors of n, written in base 2.
%C Numbers of triangle A027750, written in base 2.
%H Nathaniel Johnston, <a href="/A182620/b182620.txt">Table of n, a(n) for n = 1..7069</a>
%F T(n,k) = A007088(A027750(n,k)).
%e The divisors of 10 are 1, 2, 5, 10 then row 10 lists the binary numbers 1, 10, 101, 1010.
%e Triangle begins:
%e 1,
%e 1, 10,
%e 1, 11,
%e 1, 10, 100,
%e 1, 101,
%e 1, 10, 11, 110,
%e 1, 111,
%e 1, 10, 100, 1000,
%e 1, 11, 1001,
%e 1, 10, 101, 1010,
%e 1, 1011,
%e 1, 10, 11, 100, 110, 1100,
%p 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 Table[FromDigits[IntegerDigits[#,2]]&/@Divisors[n],{n,20}]//Flatten (* _Harvey P. Dale_, May 31 2018 *)
%Y Cf. A007088, A027750, A182621, A182622, A182623, A182624, A182630.
%K nonn,easy,tabf,base
%O 1,3
%A _Omar E. Pol_, Nov 22 2010
%E a(38)-a(55) from _Nathaniel Johnston_, Apr 19 2011