[seqfan] Re: Add-if-odd sequence

[Douglas McNeil]

I suspect the conjecture is true; I can show the minimum
counterexample has > 10^4 digits using a bit of computation and the
fact that a(n+1)-a(n) <= 9*d, where d is the number of digits of a(n).

That the number of steps to find a cycle grows so slowly makes me
think there must be a shortish pigeonhole proof, though I can't make
one work.


Doug

--
Department of Earth Sciences
University of Hong Kong