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
Robert Israel, Table of n, a(n) for n = 1..10000
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
Vladimir Joseph Stephan Orlovsky, Jul 21 2009
STATUS
approved