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 A048823 #9 Jul 09 2021 21:49:53 %S A048823 0,1,0,1,1,2,0,1,1,2,0,1,2,1,0,1,1,2,1,2,2,3,0,1,1,1,2,3,1,2,0,1,1,2, %T A048823 0,1,2,1,0,1,2,3,2,1,2,3,0,1,1,1,1,2,1,2,0,1,2,3,0,1,2,1,0,1,1,2,1,2, %U A048823 1,2,0,1,1,1,2,2,1,2,0,1,1,2,0,1,2,3,2,3,1,1,2,2,3,2,0,1,1,1,1,2,1,2,1 %N A048823 a(n) = value of n defined as follows: start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by subtracting 1. The division steps are free, but subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2. %H A048823 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a048/A048823.java">Java program</a> (github) %Y A048823 Cf. A047988. Same formula except you cannot add 1 (only subtract). %K A048823 nonn %O A048823 2,6 %A A048823 _Christian G. Bower_, May 15 1999 %E A048823 Missing a(2)=0 inserted by _Sean A. Irvine_, Jul 09 2021