Revision history [back]
 | 1 | initial version |
Some years ago, on a blog on the OEIS, I implemented various algorithms with a simple common interface in Sage, written in Python2.
Your question prompted me to update the code to Python3 and make it available on GitHub. It also describes how to experiment with it on the Sage Cell Server.
Specifying the three coefficients (a, b, c) and the desired restriction, one of {all, primitively, prime}, not only returns the representatives but also points to the sequence in the OEIS (if it is registered there).
https://github.com/PeterLuschny/BinaryQuadraticForms
