A182650 Algorithm: x->[x*(r+1)] if x even, x->[x/(r+1)] if x odd, where r = golden mean = (1+sqrt(5))/2, and [ ] = floor; a(n) is the number of steps from x=n to 0.

2, 1, 5, 3, 7, 2, 4, 6, 10, 6, 8, 4, 6, 8, 12, 3, 5, 3, 7, 5, 7, 7, 9, 11, 15, 11, 13, 7, 11, 9, 13, 5, 7, 5, 9, 7, 9, 9, 11, 13, 17, 4, 6, 4, 8, 6, 10, 4, 6, 8, 12, 8, 10, 6, 10, 8, 12, 8, 10, 8, 12, 10, 12, 12, 14, 16, 20, 16, 18, 12, 16, 14, 18, 8, 10

Offset

1,1

Links

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

Example

3->[3r+3]=7 (step 1)
7->[7r+7]=18 (step 2)
18->[18/(r+1)]=6 (step 3)
6->[6/(r+1)]=2 (step 4)
2->[2/(r+1)]=0 (step 5),
so that a(3)=5.

Crossrefs

A182649, A182651, A182652.

Sequence in context: A262211 A345967 A094512 * A127367 A054084 A296069

Adjacent sequences: A182647 A182648 A182649 * A182651 A182652 A182653

Keyword

nonn

Author

Clark Kimberling, Nov 26 2010

Status

approved