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 A033909 #5 Jul 08 2025 19:58:35 %S A033909 0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,1,0, %T A033909 0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1,1,1,3,2,0,0, %U A033909 0,0,1,1,1,3,2,2,2,0,0,0 %N A033909 Number of Sort then Add steps needed to reach a sorted number, or -1 if never reach sorted number. %e A033909 64 -> 64+46=110 -> 110+11=121 -> 121+112 = 233, taking 3 steps to reach a sorted number, so a(64)=3. %Y A033909 Cf. A033863, A033908. %K A033909 nonn,base %O A033909 0,65 %A A033909 _N. J. A. Sloane_