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 A262303 #13 Oct 03 2015 10:23:15 %S A262303 0,0,0,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, %T A262303 3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, %U A262303 4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5 %N A262303 Length of sequence of lower halves of n: repeatedly apply x->floor(x/2) starting at n; a(n) = number of steps until reach one of 2,3,4. %H A262303 S. Jablan, L. H. Kauffman, and P. Lopes, <a href="http://arxiv.org/abs/1406.2378">The delunification process and minimal diagrams</a>, arXiv:1406.2378 [math.GT], 2014. %H A262303 S. Jablan, L. H. Kauffman, and P. Lopes, <a href="http://dx.doi.org/10.1016/j.topol.2015.07.010">The delunification process and minimal diagrams</a>, Topology Appl., 193 (2015), 270-289, #5531. %e A262303 20->10->5->2 takes 3 steps, so a(20)=3. %Y A262303 Cf. A262304. %K A262303 nonn,easy %O A262303 2,9 %A A262303 _N. J. A. Sloane_, Sep 30 2015 %E A262303 a(31)-a(88) from _Hiroaki Yamanouchi_, Oct 03 2015