OFFSET

1,1

COMMENTS

Ceiling equivalent of A219303, with somewhat different behavior despite a near-identical iterative process.

Conjecture #1: All numbers under the iteration reach 0 or, like the elements of this sequence, reach a finite loop, and none expand indefinitely to infinity.

Conjecture #2: There are an infinite number of such finite loops, though there is often significant distance between them.

Conjecture #3: There are an infinite number of pairs of consecutive integers in this sequence despite being less abundant than in A219303.

LINKS

Carl R. White, Table of n, a(n) for n = 1..10000

EXAMPLE

1702 is in this list as 38 iterations return to 1702. Many other numbers reach this loop. 5832 is also in this list and is the smallest member of a different loop.

1703 is _not_ in this list because the iteration runs: 1703 -> 2562 -> 1989 -> 1620 -> 2501 -> 5100 -> 6048 -> 2808 -> 53 -> 88 -> 120 -> 11 -> 20 -> 25 -> 0.

MATHEMATICA

f[n_] := Ceiling[Sqrt[n]]*(Ceiling[Sqrt[n]]^2 - n); Select[Range[5000], NestWhileList[f, #, UnsameQ, All][[-1]] > 0 &] (* T. D. Noe, Dec 04 2012 *)

CROSSREFS

KEYWORD

nonn

AUTHOR

Carl R. White, Dec 02 2012

STATUS

approved