id:A063251 - OEIS Search Results

Search: id:A063251

Displaying 1-1 of 1 results found.

page 1

Least number of binary rotations needed to reach fixed point (with either left or right rotation allowed at each iteration).

+0
2

0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 4, 3, 3, 4, 2, 1, 2, 2, 3, 2, 3, 3, 3, 2, 3 (list; graph; listen)

	OFFSET	`0,11`
	COMMENT	`Fixed points are of the form 2^k-1. Left rotation is A006257, right rotation is A038572. Only-left order is A048881, only-right order is A063250. n for which mixed L/R order beats min of only-left, only-right is A063252.`
	EXAMPLE	`a(22)=2 with 22 right-> 11 left-> 7. (only-left requires 3, only-right requires 4)`
	CROSSREFS	`A006257, A038572, A048881, A063250, A063252.` `Sequence in context: A108804 A127249 A127251 this_sequence A060208 A004570 A145363` `Adjacent sequences: A063248 A063249 A063250 this_sequence A063252 A063253 A063254`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Jul 11 2001`

page 1

Search completed in 0.002 seconds

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.

AT&T Labs Research