Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists.

A060380

Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists.