Find prime numbers of the form n*n*n+2

Find prime numbers of the form n*n*n+2 is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Task

Find prime numbers of form   n³+2,   where 0 < n < 200

Ring

<lang ring> load "stdlib.ring"

see "working..." + nl

for n = 1 to 200

   pr = pow(n,3)+2
   if isprime(pr)
      see "n: " + n + " n*n*n+3 : " + pr + nl
   ok

next

see "done..." + nl </lang>

Output:

working...
n: 1 n*n*n+3 : 3
n: 3 n*n*n+3 : 29
n: 5 n*n*n+3 : 127
n: 29 n*n*n+3 : 24391
n: 45 n*n*n+3 : 91127
n: 63 n*n*n+3 : 250049
n: 65 n*n*n+3 : 274627
n: 69 n*n*n+3 : 328511
n: 71 n*n*n+3 : 357913
n: 83 n*n*n+3 : 571789
n: 105 n*n*n+3 : 1157627
n: 113 n*n*n+3 : 1442899
n: 123 n*n*n+3 : 1860869
n: 129 n*n*n+3 : 2146691
n: 143 n*n*n+3 : 2924209
n: 153 n*n*n+3 : 3581579
n: 171 n*n*n+3 : 5000213
n: 173 n*n*n+3 : 5177719
n: 189 n*n*n+3 : 6751271
done...