login

Revision History for A144790

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
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.
(history; published version)
#13 by Alois P. Heinz at Fri Oct 27 20:59:56 EDT 2017
STATUS

proposed

approved

#12 by Michael De Vlieger at Thu Oct 26 20:51:14 EDT 2017
STATUS

editing

proposed

#11 by Michael De Vlieger at Thu Oct 26 20:50:54 EDT 2017
MATHEMATICA

Array[Min@ Map[Length, Select[Split@ IntegerDigits[#, 2], First@ # == 1 &]] &, 105] (* Michael De Vlieger, Oct 26 2017 *)

CROSSREFS
#10 by Michael De Vlieger at Thu Oct 26 20:50:17 EDT 2017
LINKS

Michael De Vlieger, <a href="/A144790/b144790.txt">Table of n, a(n) for n = 1..16384</a>

STATUS

approved

editing

#9 by Charles R Greathouse IV at Tue Mar 11 01:32:27 EDT 2014
AUTHOR

__Leroy Quet__, , Sep 21 2008

Discussion
Tue Mar 11
01:32
OEIS Server: https://oeis.org/edit/global/2122
#8 by N. J. A. Sloane at Wed Feb 05 20:18:50 EST 2014
AUTHOR

__Leroy Quet_, _, Sep 21 2008

Discussion
Wed Feb 05
20:18
OEIS Server: https://oeis.org/edit/global/2118
#7 by N. J. A. Sloane at Wed Feb 05 20:12:00 EST 2014
AUTHOR

_Leroy Quet, _, Sep 21 2008

Discussion
Wed Feb 05
20:12
OEIS Server: https://oeis.org/edit/global/2117
#6 by Bruno Berselli at Fri Jan 18 17:34:51 EST 2013
STATUS

proposed

approved

#5 by Michel Marcus at Fri Jan 18 17:08:00 EST 2013
STATUS

editing

proposed

#4 by Michel Marcus at Fri Jan 18 17:06:56 EST 2013
NAME

Consider the runs of 1's in the binary representation of n, each of these runs being on the edge of the binary repersentation representation n and/or being bounded by 0's. a(n) = the length of the shortest such run of 1's in binary n.

STATUS

approved

editing