A087676 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.

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, 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, 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

Offset

6,2

Comments

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

Links

Table of n, a(n) for n=6..110.

J. C. Lagarias and N. J. A. Sloane, Approximate squaring (pdf, ps), Experimental Math., 13 (2004), 113-128.

Crossrefs

Cf. A087675, A087677.

Sequence in context: A063866 A059106 A318521 * A291207 A058813 A336018

Adjacent sequences: A087673 A087674 A087675 * A087677 A087678 A087679

Keyword

nonn

Author

N. J. A. Sloane, following a suggestion of Bela Bajnok (bbajnok(AT)gettysburg.edu), Sep 27 2003

Status

approved