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 A087677 #5 Oct 04 2012 10:28:48 %S A087677 2,21,240,3,10,11,4,170195636,84,5,736,922709,6,38,40,7,374,10751097, %T A087677 8,550,598,9,84,87,10,1173908,1371360,11,262696240,203210,12,148,152, %U A087677 13,72879280,2419,14,588799,44088,15,230,235,16,4263,20523050,17,5096,5300,18,330,336 %N A087677 Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached. %C A087677 It is conjectured that an integer is always reached if the initial value is >= 2. %H A087677 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 A087677 Cf. A087675, A087676. %K A087677 nonn %O A087677 6,1 %A A087677 _N. J. A. Sloane_, following a suggestion of Bela Bajnok (bbajnok(AT)gettysburg.edu), Sep 27 2003