A327008 a(n) = number of iterations of f(x)=floor((x^2+n^2)/(2x)) starting at x=n^2 to reach the value n.

0, 1, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9

Offset

1,3

Links

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

Formula

a(n) = A327007(n^2).

Crossrefs

Cf. A000196, A327007, A327009, A327010.

Sequence in context: A260998 A361110 A324728 * A316846 A130241 A130247

Adjacent sequences: A327005 A327006 A327007 * A327009 A327010 A327011

Keyword

nonn

Author

Max Alekseyev, Aug 12 2019

Status

approved