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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075120 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. 2
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; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Starting with A073890(n)/A075119(n).

LINKS

Table of n, a(n) for n=1..50.

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: A260941 A256038 A050327 * A111593 A111594 A237996

Adjacent sequences:  A075117 A075118 A075119 * A075121 A075122 A075123

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Sep 03 2002

STATUS

approved

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

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

Last modified August 27 19:53 EDT 2015. Contains 261098 sequences.