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 A056796 #6 Apr 11 2012 10:14:50 %S A056796 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 A056796 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 A056796 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 A056796 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 A056796 Proposed by _Mark Sapir_, Math. Dept., Vanderbilt University, August 2000. %H A056796 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %Y A056796 Cf. A056792, A056817. %K A056796 nonn %O A056796 0,3 %A A056796 _David W. Wilson_, Sep 07 2000