A087665 -id:A087665 - cp's OEIS frontend

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

0, 2, 1, 4, 0, 5, 2, 9, 0, 1, 1, 1, 0, 3, 3, 2, 0, 4, 1, 2, 0, 6, 2, 7, 0, 1, 1, 1, 0, 5, 4, 4, 0, 2, 1, 3, 0, 8, 2, 7, 0, 1, 1, 1, 0, 2, 3, 6, 0, 3, 1, 2, 0, 2, 2, 2, 0, 1, 1, 1, 0, 4, 5, 5, 0, 2, 1, 6, 0, 5, 2, 4, 0, 1, 1, 1, 0, 4, 3, 2, 0, 5, 1, 2, 0, 3, 2, 3, 0, 1, 1, 1, 0, 4, 4, 6, 0, 2, 1, 3, 0, 3, 2, 3, 0

Offset: 8

Graph
List
Refs
Listen
History
Text
Internal format

N. J. A. Sloane, Sep 27 2003

nonn

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

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

Cf. A087665 (integer reached), A087667 and A087668 (records), A057016.

More terms from John W. Layman, Sep 27 2003

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions