The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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
 2, 18, 5, 550935, 3, 3396542576998428, 105 (list; graph; refs; listen; history; text; internal format)
 OFFSET 8,1 COMMENTS It is conjectured that an integer is always reached if the initial value is >= 2. a(133) has 6227 digits. - Michael S. Branicky, Feb 18 2021 LINKS Michael S. Branicky, Table of n, a(n) for n = 8..132 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 for n in range(8, 15): print(a(n)) # Michael S. Branicky, Feb 18 2021 CROSSREFS Cf. A087664 (steps to reach an integer), A087667, A087668. Sequence in context: A253603 A094048 A179073 * A093481 A132629 A288161 Adjacent sequences:  A087662 A087663 A087664 * A087666 A087667 A087668 KEYWORD nonn AUTHOR N. J. A. Sloane, Sep 27 2003 EXTENSIONS The next term is too large to include. STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 06:52 EST 2021. Contains 349543 sequences. (Running on oeis4.)