id:A083863 - OEIS Search Results

Search: id:A083863

Displaying 1-1 of 1 results found.

page 1

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.

+0
4

2, 336, 480480, 3, 10, 11, 4, 86632, 336, 5, 480480, 60208858513949492539235528793891301776841444950919877032569117242963296157136688\ 3360109083120, 6, 38, 40, 7, 2618, 8089284, 8, 4400, 4784, 9, 84, 87, 10, 164651957685772369755334525952840, 267038744632379007295584790187520, 11, 3260628657396881107663076132351728 (list; graph; listen)

	OFFSET	`6,1`
	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. A087666 (steps to reach an integer), A086336, A087663.` `Sequence in context: A088250 A142355 A159488 this_sequence A057626 A063968 A064501` `Adjacent sequences: A083860 A083861 A083862 this_sequence A083864 A083865 A083866`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 27 2003`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research