id:A087664 - OEIS Search Results

Search: id:A087664

Displaying 1-1 of 1 results found.

page 1

Consider recurrence b(0) = n/4, 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
4

0, 2, 1, 4, 0, 5, 2, 9, 0, 1, 1, 1, 0, 3, 3, 2, 0, 4, 1, 2, 0, 6, 2, 7, 0, 1, 1, 1, 0, 5, 4, 4, 0, 2, 1, 3, 0, 8, 2, 7, 0, 1, 1, 1, 0, 2, 3, 6, 0, 3, 1, 2, 0, 2, 2, 2, 0, 1, 1, 1, 0, 4, 5, 5, 0, 2, 1, 6, 0, 5, 2, 4, 0, 1, 1, 1, 0, 4, 3, 2, 0, 5, 1, 2, 0, 3, 2, 3, 0, 1, 1, 1, 0, 4, 4, 6, 0, 2, 1, 3, 0, 3, 2, 3, 0 (list; graph; listen)

	OFFSET	`8,2`
	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. A087665 (integer reached), A087667 and A087668 (records), A057016.` `Sequence in context: A001442 A158285 A059781 this_sequence A158032 A120112 A103977` `Adjacent sequences: A087661 A087662 A087663 this_sequence A087665 A087666 A087667`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 27 2003`
	EXTENSIONS	`More terms from John W. Layman (layman(AT)math.vt.edu), Sep 27 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research