login
Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 2.
1

%I #6 Apr 11 2012 10:23:40

%S 0,1,2,3,3,4,4,5,4,5,5,6,5,6,6,6,5,6,6,7,6,7,7,7,6,7,7,8,7,8,7,7,6,7,

%T 7,8,7,8,8,8,7,8,8,9,8,9,8,8,7,8,8,9,8,9,9,9,8,9,9,9,8,9,8,8,7,8,8,9,

%U 8,9,9,9,8,9,9,10,9,10,9,9,8,9,9,10,9,10,10,10,9,10,10,10,9,10,9,9,8,9,9

%N Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 2.

%H <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>

%F a(2n)=a(n)+1; a(2n+1)=min{a(n)+2, a(n+1)+2}; a(0)=0, a(1)=1.

%e a(23)=7 since 23=(0+1+1+1)*2*2*2-1.

%Y Cf. A056792.

%K nonn

%O 0,3

%A _Henry Bottomley_, Jun 06 2001