This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144790 Consider the runs of 1's in the binary representation of n, each of these runs being on the edge of the binary representation n and/or being bounded by 0's. a(n) = the length of the shortest such run of 1's in binary n. 4
 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 4, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 4, 1, 5, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Michael De Vlieger, Table of n, a(n) for n = 1..16384 EXAMPLE 19 in binary is 10011. The runs of 1's are as follows: (1)00(11). The shortest of these runs contains exactly one 1. So a(19) = 1. MATHEMATICA Array[Min@ Map[Length, Select[Split@ IntegerDigits[#, 2], First@ # == 1 &]] &, 105] (* Michael De Vlieger, Oct 26 2017 *) CROSSREFS Cf. A038374, A144789. Sequence in context: A136256 A283440 A159864 * A090996 A309736 A237453 Adjacent sequences:  A144787 A144788 A144789 * A144791 A144792 A144793 KEYWORD base,nonn AUTHOR Leroy Quet, Sep 21 2008 EXTENSIONS Extended by Ray Chandler, Nov 04 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 24 03:51 EDT 2019. Contains 326260 sequences. (Running on oeis4.)