id:A144790 - OEIS Search Results

Search: id:A144790

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`1,3`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	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.`
	CROSSREFS	`A038374, A144789` `Sequence in context: A166967 A136256 A159864 this_sequence A090996 A089309 A126387` `Adjacent sequences: A144787 A144788 A144789 this_sequence A144791 A144792 A144793`
	KEYWORD	`base,nonn`
	AUTHOR	`Leroy Quet, Sep 21 2008`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 04 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research