|
Search: id:A087670
|
|
|
| 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. |
|
+0
2
|
|
| 3, 5, 336, 18, 8003163168, 86632, 7191948600, 17, 72960
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It is conjectured that an integer is always reached if the initial value is >= 2.
|
|
LINKS
|
J. C. Lagarias and N. J. A. Sloane, Approximate squaring (pdf, ps), Experimental Math., 13 (2004), 113-128.
|
|
CROSSREFS
|
Cf. A087669 (steps to reach an integer), A087666.
Sequence in context: A058846 A101331 A087368 this_sequence A138584 A002427 A136134
Adjacent sequences: A087667 A087668 A087669 this_sequence A087671 A087672 A087673
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Sep 27 2003
|
|
EXTENSIONS
|
The next term is too large to include.
|
|
|
Search completed in 0.002 seconds
|
