login
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.
3

%I #5 Mar 30 2012 18:57:12

%S 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,

%T 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,

%U 8,12,10,12,12,14,16,20,16,18,12,16,14,18,8,10

%N 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.

%e 3->[3r+3]=7 (step 1)

%e 7->[7r+7]=18 (step 2)

%e 18->[18/(r+1)]=6 (step 3)

%e 6->[6/(r+1)]=2 (step 4)

%e 2->[2/(r+1)]=0 (step 5),

%e so that a(3)=5.

%Y A182649, A182651, A182652.

%K nonn

%O 1,1

%A _Clark Kimberling_, Nov 26 2010