|
|
A087665
|
|
Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives first integer reached, or -1 if no integer is ever reached.
|
|
2
|
|
|
|
OFFSET
|
8,1
|
|
COMMENTS
|
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.
|
|
PROG
|
(Python)
from fractions import Fraction
def a(n):
b = Fraction(n, 4)
while b.denominator != 1: b *= int(b)
return b
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
The next term is too large to include.
|
|
STATUS
|
approved
|
|
|
|