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 A048825 #9 Dec 19 2015 13:17:36 %S A048825 0,1,0,2,1,1,0,1,2,1,0,2,1,1,0,2,1,3,2,1,1,1,0,2,2,1,1,2,1,1,0,1,2,1, %T A048825 0,3,2,1,0,2,1,2,1,1,1,1,0,1,2,2,2,2,1,1,0,3,2,1,0,2,1,1,0,2,1,3,2,1, %U A048825 1,1,0,3,2,1,2,1,1,1,0,1,2,1,0,2,2,2,1,2,1,2,1,1,1,1,0,2,1,1,2,3,2,3,2 %N A048825 Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding 1. The division steps are free, but adding 1 costs 1 point. a(n) is the smallest cost to reach 2. %Y A048825 Cf. A047988. Same formula except you cannot subtract 1 (only add). %K A048825 nonn %O A048825 2,4 %A A048825 _Christian G. Bower_, May 15 1999 %E A048825 Edited by _Max Alekseyev_, Jun 13 2011