Confirmation

[David Wilson]

Define

    f(1) = 1
    f(n+1) = f(n) + (f(n) mod n+3364).

I wrote a computer program to find the smallest x with

    x+3365 divides f(x)

The value of x found is just under 8,350,000,000 and the corresponding f(x) just under 2^64. Although my program included an overflow check, I am still not comfortable because this value of f(x) is close to my 64-bit unsigned integer size.

Could someone with a fast computer, preferably a UNIX box, please confirm or refute my values?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20061121/29d99a7e/attachment-0001.htm>