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 A164714 #11 Jan 13 2021 19:06:24
%S A164714 10,21,36,42,54,73,85,136,170,204,219,238,273,292,341,438,528,585,682,
%T A164714 792,819,924,990,1057,1365,1755,1911,2080,2184,2340,2730,3120,3171,
%U A164714 3276,3510,3640,3822,3900,4030,4161,4369,4681,5461,7399,8256,10922,12384
%N A164714 A positive integer n is included if all runs of 0's in binary n are of the same length, and if all runs of 1's in binary n are of the same length, and if there are at least two runs of 0's and at least two runs of 1's.
%C A164714 Clarification: A binary number consists of "runs" completely of 1's alternating with runs completely of 0's. No two or more runs all of the same digit are adjacent.
%C A164714 The length of each run of 1's may be different that the length of each run of 0's.
%C A164714 This sequence contains those positive integers in both sequence A164709 and sequence A164712.
%C A164714 The integers of this sequence, along with those positive integers that have (when written in binary) only one run of 0's and/or only one run of 1's, make up sequence A164713.
%H A164714 Harvey P. Dale, <a href="/A164714/b164714.txt">Table of n, a(n) for n = 1..100</a>
%t A164714 bslQ[n_]:=Module[{r=Split[IntegerDigits[n,2]]},Length[r]>3&&Length[ Union[ Length/@Take[r,{1,-1,2}]]]==1&&Length[Union[Length/@Take[r,{2,-1,2}]]] == 1]; Select[Range[13000],bslQ] (* _Harvey P. Dale_, Jan 13 2021 *)
%Y A164714 A164709, A164712, A164713
%K A164714 base,nonn
%O A164714 1,1
%A A164714 _Leroy Quet_, Aug 23 2009
%E A164714 More terms from _Sean A. Irvine_, Sep 28 2009