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 #14 Mar 31 2015 17:01:58
%S 2,4,5,6,10,11,12,13,14,16,18,22,23,24,26,27,28,29,30,36,40,42,46,47,
%T 48,54,55,58,59,60,61,62,65,75,76,78,80,84,88,90,94,95,99,100,102,104,
%U 105,108,110,111,112,114,118,119,120,122,123,124,125,126,132,140,144,145
%N Numbers n such that number of non-leading 0's in binary representation of n divides n.
%C Contains primes of A095078(n) as a subset. Intersection of a(n) with A049445(n) is A117891(n). - _R. J. Mathar_, Apr 03 2006
%H Reinhard Zumkeller, <a href="/A117890/b117890.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n)<=A117891(n) - _R. J. Mathar_, Apr 03 2006
%F a(n) mod A023416(a(n)) = 0. - _Reinhard Zumkeller_, Nov 22 2007
%e 24 is 11000 in binary. This binary representation has three 0's and 3 divides 24. So 24 is in the sequence.
%o (C) #include <stdio.h> int main(int argc, char *argv[]) { for(int n=1; n< 500; n++) { int digs=0; int nshifted=n; while(nshifted) { digs += 1- nshifted & 1; nshifted >>= 1; } if ( digs) if( n % digs == 0 ) printf("%d,",n); } } - _R. J. Mathar_, Apr 03 2006
%o (Haskell)
%o a117890 n = a117890_list !! (n-1)
%o a117890_list = [x | x <- [1..], let z = a023416 x, z > 0, mod x z == 0]
%o -- _Reinhard Zumkeller_, Mar 31 2015
%Y Cf. A049445, A117891.
%Y Cf. A023416.
%K easy,nonn
%O 1,1
%A _Leroy Quet_, Mar 30 2006
%E More terms from _R. J. Mathar_, Apr 03 2006