All of our code and algorithms can be found in the Ramanujan Machine’s git repo found here.
Our work is open source. Feel free to reach out to us with any questions and suggestions 🙂
We also have a few python notebooks where you can directly run some of our code:
Euler solvers: Finding whether a given polynomial continued fraction is in the Euler family (see here for more mathematical details).
Coboundary solvers: Find out if two polynomial continued fraction (or more generally, polynomial matrices) are coboundary equivalent (see here for more mathematical details).
Numerical Identification: We have our own tool for identifying and connecting numerical values.
For older versions of the algorithm, please refer to this link.