id:A075120 - OEIS Search Results

Search: id:A075120

Displaying 1-1 of 1 results found.

page 1

Number of steps to reach the first integer (=A075121(n)) starting with n/floor(SquareRoot(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.

+0
3

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

	OFFSET	`1,5`
	COMMENT	`Starting with A073890(n)/A075119(n).`
	EXAMPLE	`a(13)=3 since 13/floor(SquareRoot(13))=13/3 -> 65/3 -> 1430/3 -> 227370=A075121(13).`
	CROSSREFS	`Cf. A068119, A073524, A075102, A075107.` `Sequence in context: A036853 A036852 A050327 this_sequence A111593 A111594 A105348` `Adjacent sequences: A075117 A075118 A075119 this_sequence A075121 A075122 A075123`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 03 2002`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research