id:A063250 - OEIS Search Results

Search: id:A063250

Displaying 1-1 of 1 results found.

page 1

Number of binary right-rotations (iterations of A038572) to reach fixed point.

+0
4

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

	OFFSET	`0,5`
	COMMENT	`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`
	CROSSREFS	`A038572, A048881.` `Adjacent sequences: A063247 A063248 A063249 this_sequence A063251 A063252 A063253` `Sequence in context: A060086 A062135 A068926 this_sequence A107424 A065177 A064044`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Jul 11 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research