This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A166111 #9 Feb 01 2019 15:11:35
%S A166111 1,2,3,5,6,7,10,11,12,13,14,15,19,21,22,23,25,26,27,28,29,30,31,38,39,
%T A166111 42,43,44,45,46,47,50,51,52,53,54,55,56,57,58,59,60,61,62,63,71,75,76,
%U A166111 77,78,79,83,85,86,87,89,90,91,92,93,94,95,100,101,102,103,105,106,107
%N A166111 A positive integer n is included if the longest contiguous run of similar digits in binary n is of 1's.
%C A166111 For some n included in this sequence, it is possible that the longest run of 0's in binary n is of the same length as the longest run of 1's in binary n. (See sequence A090050.)
%t A166111 lcr1Q[n_]:=Module[{s=Split[IntegerDigits[n,2]]},Max[Length/@Select[s, MemberQ[ #,1]&]] >= Max[Length/@Select[s,MemberQ[#,0]&]]]; Select[ Range[ 120],lcr1Q] (* _Harvey P. Dale_, Feb 01 2019 *)
%Y A166111 Cf. A043276, A090050, A166110.
%K A166111 base,nonn
%O A166111 1,2
%A A166111 _Leroy Quet_, Oct 06 2009
%E A166111 Extended by _Ray Chandler_, Mar 12 2010