Summary: 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 computing an arbitrary term of the sequence, and consider a graph-theoretic approach to computing the same.

11D45, 11D72, 05C38

system of Diophantine equations