cp's OEIS Frontend

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.

A087670 The first integer in the sequence defined by b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.

This page as a plain text file.
%I A087670 #7 Oct 04 2012 10:28:48
%S A087670 3,5,336,18,8003163168,86632,7191948600,17,72960
%N A087670 The first integer in the sequence defined by b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.
%C A087670 a(10) ~= 2.767*10^155 is too large to show here.
%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://neilsloane.com/doc/apsq.pdf">pdf</a>, <a href="http://neilsloane.com/doc/apsq.ps">ps</a>), Experimental Math., 13 (2004), 113-128.
%Y A087670 Cf. A087669 (steps to reach an integer), A087666.
%K A087670 nonn
%O A087670 1,1
%A A087670 _N. J. A. Sloane_, Sep 27 2003