We consider a certain left action by the monoid SL2(N0) on the set of divisor pairs Df:={(m,n)∈N0×N0:m∣f(n)} where f∈Z[x] is a polynomial with integer coefficients. We classify all polynomials in Z[x] for which this action extends to an invertible map F^f:SL2(N0)→Df. We call such polynomials enumerable. One of these polynomials happens to be f(n)=n2+1. It is a well-known conjecture that there exist infinitely many primes of the form p=n2+1. We construct a sequence S on the naturals defined by the recursions ⎩⎨⎧S(4k)=2S(2k)−S(k)S(4k+1)=2S(2k)+S(2k+1)S(4k+2)=2S(2k+1)+S(2k)S(4k+3)=2S(2k+1)−S(k) with initial conditions S(1)=0, S(2)=1, S(3)=1. {S(k)}k∈N={0,1,1,2,3,3,2,3,7,8,5,5,8,7,3,⋯}S is shown to have the properties 1. For all n∈N0, we have S(2n)=S(2n+1−1)=n. 2. For all n∈N0, the size of the fiber of n under S satisfies ∣S−1({n})∣=τ(n2+1) where τ is the divisor counting function. 3. For all n∈N0, the integer n2+1 is prime if and only if S−1({n})={2n,2n+1−1}. 4.S(k) is a 2-regular sequence.