A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Journal of Integer Sequences
We consider a sequence defined by the number of positive solutions to a sequence of systems of Diophantine equations. We derive some bounds on the solutions to demonstrate that the terms of the sequence are finite. We develop an algorithm for 1 computing an arbitrary term of the sequence, and consider a graph-theoretic approach to computing the same.fatcat:s6zc6srjcfhe3nmuybpqpdhxga