login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A043756 Numbers n such that number of runs in the base 2 representation of n is congruent to 2 mod 9. 0

%I #7 Sep 24 2016 15:40:01

%S 2,4,6,8,12,14,16,24,28,30,32,48,56,60,62,64,96,112,120,124,126,128,

%T 192,224,240,248,252,254,256,384,448,480,496,504,508,510,512,768,896,

%U 960,992,1008,1016,1020,1022,1024,1365,1536,1792

%N Numbers n such that number of runs in the base 2 representation of n is congruent to 2 mod 9.

%t Select[Range[2000],Mod[Length[Split[IntegerDigits[#,2]]],9]==2&] (* _Harvey P. Dale_, Sep 24 2016 *)

%K nonn,base

%O 1,1

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:23 EDT 2024. Contains 371960 sequences. (Running on oeis4.)