Representation of integers in subsequences of the positive integers by binary quadratic forms (Q5941890)

Let \(C\) be a class of primitive binary quadratic forms, and let \(R\) be the genus containing~\(C\). A number is said to be \(C\)-exceptional if it is representable by a form in \(R\) but not by a form in~\(C\). It is known that the counting function for \(R\)-representable numbers up to~\(x\) has an asymptotic formula \(Bx/(\log x)^{1/2}\) for some constant \(B>0\), and, in a previous paper [\textit{O. M. Fomenko}, Zap. Nauchn. Semin. POMI 226, 196-227 (1996; Zbl 0896.11016)], the author established that the counting function for \(C\)-exceptional numbers has the order \(O( x/(\log x)^{2/3})\). In the present paper, the author extends the result to certain sequences such as \(a_n=n(n+1)\) and \(a_n=p_n +l\), where \(p_n\) is the \(n\)th prime and \(l\neq 0\).