%I A087670
%S A087670 3,5,336,18,8003163168,86632,7191948600,17,72960
%N A087670 Consider recurrence b(0) = (2n+1)/n, b(n) = b(n-1)*floor(b(n-1)); sequence 
               gives number of steps to reach an integer, or -1 if no integer is 
               ever reached.
%C A087670 It is conjectured that an integer is always reached if the initial value 
               is >= 2.
%H A087670 J. C. Lagarias and N. J. A. Sloane, Approximate squaring (<a href="http:/
               /www.research.att.com/~njas/doc/apsq.pdf">pdf</a>, <a href="http:/
               /www.research.att.com/~njas/doc/apsq.ps">ps</a>), Experimental Math., 
               13 (2004), 113-128.
%Y A087670 Cf. A087669 (steps to reach an integer), A087666.
%Y A087670 Sequence in context: A058846 A101331 A087368 this_sequence A138584 A002427 
               A136134
%Y A087670 Adjacent sequences: A087667 A087668 A087669 this_sequence A087671 A087672 
               A087673
%K A087670 nonn
%O A087670 1,1
%A A087670 N. J. A. Sloane (njas(AT)research.att.com), Sep 27 2003
%E A087670 The next term is too large to include.