However, the small part which is done ('classic' sequence generator) greatly outperforms* my previous attempt, which is now obsolete. It is also much more user-friendly. These are the reasons why I upload it despite its unfinished state (and also because I think it will take me a fair while to figure out the atomic algorithms

There are many tooltips to explain what each component is here for...
See Screen:

* it is even more greedy for memory though, and is in turn much slower than Kafou's program (which is also very light on memory).
By default, Java allocates only 256 Mo of memory: not enough to get past the 55th term. (the algorithm will be optimized at a later point). To allocate more memory, create a shortcut to the jar and edit it so that the path looks like javaw -Xmx1200m -jar "C:\....\****.jar". Here, the Xmx1200m argument allocates 1.2Go of RAM. You will then be able to compute many more terms.