id:A085785 - OEIS Search Results

Search: id:A085785

Displaying 1-1 of 1 results found.

page 1

Start at (2n+1)/4 and iterate the map x -> x*ceiling(x); sequence gives number of steps for denominator to drop to 1 or 2; or -1 if this never happens.

+0
4

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

	OFFSET	`2,3`
	COMMENT	`We conjecture that the denominator always does drop.`
	LINKS	`J. C. Lagarias and N. J. A. Sloane, Approximate squaring (pdf, ps), Experimental Math., 13 (2004), 113-128.`
	CROSSREFS	`A073341 gives number of steps until reach an integer. Cf. A085817, A085833.` `Adjacent sequences: A085782 A085783 A085784 this_sequence A085786 A085787 A085788` `Sequence in context: A074051 A048292 A072450 this_sequence A127929 A003118 A096409`
	KEYWORD	`nonn`
	AUTHOR	`njas, Aug 16 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research