This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A061339 #6 Apr 11 2012 10:23:40
%S A061339 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 A061339 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 A061339 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 A061339 Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 2.
%H A061339 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>
%F A061339 a(2n)=a(n)+1; a(2n+1)=min{a(n)+2, a(n+1)+2}; a(0)=0, a(1)=1.
%e A061339 a(23)=7 since 23=(0+1+1+1)*2*2*2-1.
%Y A061339 Cf. A056792.
%K A061339 nonn
%O A061339 0,3
%A A061339 _Henry Bottomley_, Jun 06 2001