[seqfan] Re: Colorless integers
robert.gerbicz at gmail.com
Wed Feb 23 00:52:00 CET 2011
2011/2/23 Robert Gerbicz <robert.gerbicz at gmail.com>
> 2011/2/22 N. J. A. Sloane <njas at research.att.com>
> Start at n, let a(n) be the smallest number in the cycle if it
>> goes into a cycle, or -1 if it diverges. Is this sequence
>> in the OEIS? and if not, you know what to do!
>> Seqfan Mailing list - http://list.seqfan.eu/
> The idea behind this that by O(1/log(n)) probability F(F(n))=n is true.
> Need another idea, up to n=10^7 there is no solution of F(F(n))=n, other
than the trivial n=0.
Does it have a loop of length two?
More information about the SeqFan