A182652 Algorithm: x->[xr] if x even, x->[x/r] is x odd, where r=sqrt(3) and [ ]=floor; a(n) is the number of steps from n to 0.

1, 3, 2, 9, 4, 8, 10, 12, 5, 7, 9, 17, 11, 15, 13, 15, 6, 8, 8, 16, 18, 22, 12, 14, 16, 18, 14, 18, 16, 18, 7, 9, 9, 15, 17, 21, 19, 21, 23, 25, 13, 39, 15, 19, 17, 19, 15, 17, 19, 25, 17, 21, 19, 21, 8, 27, 10, 14, 16, 18, 18, 20, 22, 26, 20, 24, 22, 24, 24

Offset

1,2

Links

Table of n, a(n) for n=1..69.

Example

5->[5/r]=2 (step 1)
2->[2r]=3 (step 2)
3->[3/r]=1->0 (steps 3 and 4),
so that a(5)=4.

Crossrefs

Cf. A182649, A182650, A182651.

Sequence in context: A178774 A320273 A266636 * A347365 A251555 A090880

Adjacent sequences: A182649 A182650 A182651 * A182653 A182654 A182655

Keyword

nonn

Author

Clark Kimberling, Nov 26 2010

Status

approved