login

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”).

A163140
Integers n such that in base 2, 3 `1`'s for each `0`.
2
11, 13, 14, 159, 175, 183, 187, 189, 190, 207, 215, 219, 221, 222, 231, 235, 237, 238, 243, 245, 246, 249, 250, 252, 2303, 2431, 2495, 2527, 2543, 2551, 2555, 2557, 2558, 2687, 2751, 2783, 2799, 2807, 2811, 2813, 2814, 2879, 2911, 2927, 2935, 2939, 2941
OFFSET
1,1
COMMENTS
There are (4n-1 choose n) 4n-bit members of this sequence for each n=1,2,.... - Charles R Greathouse IV, Oct 12 2009
LINKS
EXAMPLE
IntegerDigits[11,2]={1,0,1,1},..IntegerDigits[190,2]={1,0,1,1,1,1,1,0},..
MAPLE
sort([seq(op(map(proc(t) local j; 2^(4*n)-1-add(2^(j-1), j=t) end proc, combinat:-choose(4*n-1, n))), n=1..3)]);
MATHEMATICA
f0[n_]:=DigitCount[n, 2, 0]; f1[n_]:=DigitCount[n, 2, 1]; f[n_]:=f1[n]/f0[n]; lst={}; Do[If[f[n]==3, AppendTo[lst, n]], {n, 7!}]; lst
Select[Range[3000], DigitCount[#, 2, 1]==3*DigitCount[#, 2, 0]&] (* Harvey P. Dale, May 31 2015 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
STATUS
approved