OFFSET
1,2
COMMENTS
A stopping problem: number of steps to reach zero starting with n and applying: x -> x/3 if x is a multiple of 3, x -> x/2 if x is even and not a multiple of 3, x -> x-1 otherwise.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
a(n)/log(n) is bounded.
MAPLE
f:= proc(n) option remember;
if n mod 3 = 0 then procname(n/3)+1
elif n::even then procname(n/2)+1
else procname(n-1)+1
fi
end proc:
f(1):= 1:
map(f, [$1..200]); # Robert Israel, Apr 17 2023
MATHEMATICA
a[n_] := a[n] = Which[n == 1, 1, Divisible[n, 3], a[n/3]+1, EvenQ[n], a[n/2]+1, True, a[n-1]+1];
Table[a[n], {n, 1, 100}] (* Jean-François Alcover, May 28 2023 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Benoit Cloitre, Apr 07 2003
STATUS
approved