|
| |
|
|
A063250
|
|
Number of binary right-rotations (iterations of A038572) to reach fixed point.
|
|
3
| |
|
|
0, 0, 1, 0, 2, 2, 1, 0, 3, 3, 3, 3, 2, 2, 1, 0, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 0, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 0, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| a(n) = 0 when n is a fixed point of form 2^k-1 left-rotation analogue appears to be same as A048881
|
|
|
FORMULA
| If n+1 is a power of 2 then a(n)=0 otherwise a(n) = 1 + a(floor(n/2)).
|
|
|
EXAMPLE
| a(11)=3 since under right-rotation 11 -> 13 -> 14 -> 7 and 7 is a fixed point
|
|
|
MATHEMATICA
| Table[Length[FixedPointList[FromDigits[RotateRight[IntegerDigits[ #, 2]], 2]&, n]]-2, {n, 0, 110}] (* From Harvey P. Dale, Dec 23 2011 *)
|
|
|
CROSSREFS
| A038572, A048881.
Sequence in context: A190182 A068926 A146527 * A107424 A155161 A185937
Adjacent sequences: A063247 A063248 A063249 * A063251 A063252 A063253
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Marc LeBrun (mlb(AT)well.com), Jul 11 2001
|
| |
|
|
