In 1971 Richard Guy sent a letter to Neil Sloane outlining some integer sequences. One of these sequences, A279196, was added to the OEIS by Neil only in December of 2016:
A279196: Number of polynomials $P(x,y)$ with nonnegative integer coefficients such that $P(x,y) \equiv 1 \text{ (mod } x+y-1)$ and $P(1,1) = n$.
The first few terms of the sequence are:
1, 1, 2, 5, 13, 36, 102, 295, 864
In a recent lecture (see 9:50), Neil said:
I don't even know what the [...] polynomials are for the first few values, so it might be interesting to look into this.
I tried to address this in an ad hoc manner, and I managed to find all of the examples for $n \leq 3$ and three examples for $n = 4$:
$a(1) = 1$ with:
- $1$
$a(2) = 1$ with:
- $x + y = (x + y - 1) + 1$
$a(3) = 2$ with:
- $xy + x + y^2 = (y + 1) (x + y - 1) + 1$ and
- $xy + y + x^2 = (x + 1) (x + y - 1) + 1$
And for $n = 4$:
- $x^2 + y^2 = (x + y + 1)(x + y - 1) + 1$
- $x^2y + x^2 + xy^2 + y = (xy + x + 1)(x + y - 1) + 1$
- $x^2y + xy^2 + x + y^2 = (xy + y + 1)(x + y - 1) + 1$
What is an algorithm or technique to enumerate polynomials for some arbitrary $n$?
Could anyone provide an example of, say, the remaining two polynomials when $n=4$? All thirteen polynomials for $n=5$?