It gives primes for $26284$ of the integers from $1$ to $10^5$, so it's not too bad. Not quite as good from that point of view as $n^2 + n + 41$, which produces primes for $31984$ of those integers.
EDIT: your $A(n) = (9 n + 7)^2 + (9 n + 7) + 41$, so you just have a minor modification of the Euler polynomial.