

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)




