|
%I #17 Feb 18 2021 16:07:18
%S 2,18,5,550935,3,3396542576998428,105
%N 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.
%C It is conjectured that an integer is always reached if the initial value is >= 2.
%C a(133) has 6227 digits. - _Michael S. Branicky_, Feb 18 2021
%H Michael S. Branicky, <a href="/A087665/b087665.txt">Table of n, a(n) for n = 8..132</a>
%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.
%o (Python)
%o from fractions import Fraction
%o def a(n):
%o b = Fraction(n, 4)
%o while b.denominator != 1: b *= int(b)
%o return b
%o for n in range(8, 15): print(a(n)) # _Michael S. Branicky_, Feb 18 2021
%Y Cf. A087664 (steps to reach an integer), A087667, A087668.
%K nonn
%O 8,1
%A _N. J. A. Sloane_, Sep 27 2003
%E The next term is too large to include.
| 