%I A123755
%S A123755 1,1,2,1,4,2,3,1,8,4,5,1,5,1,1,3,16,6,7,3,7,4,4,6,10,5,5,6,6,6,6,5,32,
%T A123755 16,17,9,17,10,10,8,20,10,10,10,10,10,10,15,27,12,13,11,13,11,11,16,13,
%U A123755 12,13,16,14,16,16,8,64,36,37,15,37,16,16,21,39,18,19,21,20,22,22,18,44
%N A123755 a(0)=1. a(n) = number of earlier terms which are divisible by (the number 
               of 1's in the binary representation of n).
%H A123755 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A123755 9 in binary is 1001, which has 2 ones. So a(9) is the number of terms, 
               from a(0) to a(8), which are divisible by 2. a(2)=2, a(4)=4, a(5)=2 
               and a(8)=8 are the four earlier terms divisible by 2. So a(9) = 4.
%t A123755 f[l_List] := Append[l, Count[Mod[l, Plus @@ IntegerDigits[Length[l], 
               2]], 0]];Nest[f, {1}, 80] (*Chandler*)
%Y A123755 Cf. A123756, A123757.
%Y A123755 Sequence in context: A033317 A007733 A128520 this_sequence A118291 A118290 
               A132223
%Y A123755 Adjacent sequences: A123752 A123753 A123754 this_sequence A123756 A123757 
               A123758
%K A123755 easy,nonn
%O A123755 0,3
%A A123755 Leroy Quet Oct 12 2006
%E A123755 Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 16 2006