|
%I #6 Apr 11 2012 10:14:50
%S 0,1,2,2,3,4,3,4,4,3,4,5,4,5,5,5,5,6,4,5,5,5,6,7,5,6,6,4,5,6,5,6,6,6,
%T 7,8,5,6,6,6,6,7,6,7,7,6,7,8,6,7,7,7,7,8,5,6,6,6,7,8,6,7,7,6,7,8,7,8,
%U 8,8,9,10,6,7,7,7,7,8,7,8,7,5,6,7,6,7,8,7,8,9,6,7,8,7,8,9,7,8,8
%N Minimal number of steps to get from 0 to n when there are 3 kinds of step: add 1, multiply by 2, multiply by 3.
%D Proposed by _Mark Sapir_, Math. Dept., Vanderbilt University, August 2000.
%H <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>
%Y Cf. A056792, A056817.
%K nonn
%O 0,3
%A _David W. Wilson_, Sep 07 2000
|
