login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063251 Least number of binary rotations needed to reach fixed point (with either left or right rotation allowed at each iteration). 1
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; refs; listen; history; internal format)
OFFSET

0,11

COMMENTS

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: A200227 A127249 A127251 * A060208 A004570 A178064

Adjacent sequences:  A063248 A063249 A063250 * A063252 A063253 A063254

KEYWORD

base,easy,nonn

AUTHOR

Marc LeBrun (mlb(AT)well.com), Jul 11 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 09:18 EST 2012. Contains 205614 sequences.