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 A057016 #7 Oct 04 2012 10:28:39 %S A057016 5,105,18,550935,39,2730,68,2789204756584545,105,15939,150,943242300, %T A057016 203,53940,264,3714817857497700192049140000201816119835,333,137085, %U A057016 410,41463649689,495,291870,588,27194270698105759097850,689,550935,798,535022394030,915 %N A057016 Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached. %C A057016 Number of steps to reach an integer is given by A001511. No integer is reached if initial value is 3/2. %H A057016 J. C. Lagarias and N. J. A. Sloane, Approximate squaring (<a href="http://neilsloane.com/doc/apsq.pdf">pdf</a>, <a href="http://neilsloane.com/doc/apsq.ps">ps</a>), Experimental Math., 13 (2004), 113-128. %F A057016 a(2t) = t(4t+1). %Y A057016 Cf. A081853, A087666. %K A057016 nonn %O A057016 2,1 %A A057016 _N. J. A. Sloane_, Sep 27 2003