A087676 - OEIS

%I #5 Oct 04 2012 10:28:48

%S 0,3,5,0,1,1,0,12,2,0,3,7,0,1,1,0,2,7,0,2,2,0,1,1,0,5,5,0,7,4,0,1,1,0,

%T 6,2,0,4,3,0,1,1,0,2,5,0,2,2,0,1,1,0,3,3,0,6,3,0,1,1,0,3,2,0,5,5,0,1,

%U 1,0,2,3,0,2,2,0,1,1,0,5,4,0,3,4,0,1,1,0,5,2,0,3,4,0,1,1,0,2,4,0,2,2,0,1,1

%N Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.

%C It is conjectured that an integer is always reached if the initial value is >= 2.

%H 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 Cf. A087675, A087677.

%K nonn

%O 6,2

%A _N. J. A. Sloane_, following a suggestion of Bela Bajnok (bbajnok(AT)gettysburg.edu), Sep 27 2003