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 A083863 #6 Oct 04 2012 10:28:43 %S A083863 2,336,480480,3,10,11,4,86632,336,5,480480, %T A083863 602088585139494925392355287938913017768414449509198770325691172429632961571366883360109083120, %U A083863 6,38,40,7,2618,8089284,8,4400,4784,9,84,87,10,164651957685772369755334525952840,267038744632379007295584790187520,11,3260628657396881107663076132351728 %N A083863 Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached. %C A083863 It is conjectured that an integer is always reached if the initial value is >= 2. %H A083863 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. %Y A083863 Cf. A087666 (steps to reach an integer), A086336, A087663. %K A083863 nonn %O A083863 6,1 %A A083863 _N. J. A. Sloane_, Sep 27 2003