OFFSET
1,1
COMMENTS
A085068: Number of steps for iteration of map x -> (4/3)*ceiling(x) to reach an integer > n when started at n, or -1 if no such integer is ever reached.
In the creation of this sequence I have tested all integers from 0 to 400000000 and they all reach an integer.
LINKS
Robert G. Wilson v, Table of n, a(n) for n = 1..50.
MATHEMATICA
f[n_] := Block[{c = 1, k = 4 n/3}, While[ !IntegerQ@k, c++; k = 4 Ceiling@k/3]; c]; t = Table[0, {1000}]; Do[ a = f@n; If[a < 101 && t[[a]] == 0, t[[a]] = n; Print[{a, n}]], {n, 0, 2800000}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, May 27 2007
STATUS
approved