login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083863 Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached. 3
2, 336, 480480, 3, 10, 11, 4, 86632, 336, 5, 480480, 602088585139494925392355287938913017768414449509198770325691172429632961571366883360109083120, 6, 38, 40, 7, 2618, 8089284, 8, 4400, 4784, 9, 84, 87, 10, 164651957685772369755334525952840, 267038744632379007295584790187520, 11, 3260628657396881107663076132351728 (list; graph; refs; listen; history; internal format)
OFFSET

6,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.

CROSSREFS

Cf. A087666 (steps to reach an integer), A086336, A087663.

Sequence in context: A142355 A203608 A159488 * A057626 A201310 A063968

Adjacent sequences:  A083860 A083861 A083862 * A083864 A083865 A083866

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 27 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.