Least number k such that (k^2+1) mod s = prime(n) where s is the sum of the distinct primes dividing k^2+1, or 0 if no such k exists.

A272175

Least number k such that (k^2+1) mod s = prime(n) where s is the sum of the distinct primes dividing k^2+1, or 0 if no such k exists.