3 ms·
I don't really understand the status report either, because on the main page that Benjamin Chaffin says "Even after 10^230 terms, the smallest missing number is
by sp332 8y ago
I don't really understand the status report either, because on the main page that Benjamin Chaffin says "Even after 10^230 terms, the smallest missing number is still 852655." But that number isn't listed in "holes below 10^7".
As for how it may be calculated, there are several program listings there. None of them seem to be very optimized, but none of them are attributed to him, so he might have a better algorithm. Also he's a processor architect at Intel, so he might have access to some exotic hardware.
- danbruc 8y agoThe list has 52655 which almost certainly is 852655 sans the initial 8. I also read that he works at Intel and also wrote a paper together with Neil Sloane on some other sequence [1]. But no amount of access to hardware and no more or less straight forward optimization of the code given will bring you anywhere near calculating 10²³⁰ terms. You would need an algorithm that could essentially compute somewhere between 10¹⁰⁰ and 10²⁰⁰ terms per clock cycle to stand any chance. The closest thing I am aware of would by something like hashlife [2], an algorithm to speed up game of life simulations, that can advance a simulation by something on the order of 10²⁰ to 10³⁰ iterations in seconds. But this requires some regularity in the underlying problem to exploit and I was unable to find anything that seems usable in case of the Recamán sequence. [1] https://arxiv.org/abs/0912.2382v3 https://arxiv.org/abs/0912.2382v3 [2] https://en.wikipedia.org/wiki/Hashlife https://en.wikipedia.org/wiki/Hashlife