cp's OEIS Frontend

A037014 Numbers n with property that reading binary expansion from right to left (from least significant to most significant), run lengths do not increase.

%I A037014 #21 Oct 10 2019 03:55:28
%S A037014 0,1,2,3,4,5,7,8,10,11,12,15,16,19,20,21,23,24,31,32,39,40,42,43,44,
%T A037014 47,48,51,56,63,64,71,76,79,80,83,84,85,87,88,95,96,103,112,127,128,
%U A037014 143,152,159,160,167,168,170,171,172,175,176,179,184,191,192,199,204,207
%N A037014 Numbers n with property that reading binary expansion from right to left (from least significant to most significant), run lengths do not increase.
%H A037014 Reinhard Zumkeller, <a href="/A037014/b037014.txt">Table of n, a(n) for n = 1..10000</a>
%H A037014 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t A037014 Select[Range[0,250],Min[Differences[Length/@Split[IntegerDigits[ #,2]]]]>= 0&] (* _Harvey P. Dale_, Jan 30 2013 *)
%o A037014 (Haskell)
%o A037014 import Data.List (unfoldr, group)
%o A037014 a037014 n = a037014_list !! (n-1)
%o A037014 a037014_list = 0 : filter
%o A037014    (all (<= 0) . (\x -> zipWith (-) (tail $ rls x) $ rls x)) [1..] where
%o A037014        rls = map length . group . unfoldr
%o A037014              (\x -> if x == 0 then Nothing else Just $ swap $ divMod x 2)
%o A037014 -- _Reinhard Zumkeller_, Mar 10 2012
%Y A037014 Cf. A037013 (subsequence), A037016, A037015.
%K A037014 nonn,easy,base,nice
%O A037014 1,3
%A A037014 _N. J. A. Sloane_
%E A037014 More terms from _Patrick De Geest_, Feb 15 1999
%E A037014 Offset fixed by _Reinhard Zumkeller_, Mar 10 2012