Given a prime $p \equiv3 \mod 4$ ($p\geq7$) then the polynomial $n^2+n+\frac{p+1}{4}$ returns prime numbers for all $n\in\{0,1,\dots,\frac{p-7}{4} \}$. I have a sketch of a proof for this statement, but I haven't been able to fill in all the details. I am considering $K=\mathbb{Q}(\sqrt{-p})$, with $\mathcal{O}_K=\mathbb{Z}[ \frac{1+\sqrt{-p}}{2}]$. The proposed steps are as follows:
First, no element $z\in\mathcal O _K$ has a norm $l$, with $l\leq \frac{p-3}{4}$ being a prime number.
Second, all prime numbers $l\leq \frac{p-3}{4}$ are inert in $\mathcal O _K$.
Third, the elements $n+\frac{1+\sqrt{-p}}{2}\in\mathcal O _K$ (with $n\in\mathbb Z$) cannot be divided by prime numbers.
Fourth, if a prime element $\pi \in\mathcal O_K$ is a divisor of $n+\frac{1+\sqrt{-p}}{2}$ (with $n\in\mathbb Z$), then the norm of $\pi$ is a prime number greater or equal than $\frac{p+1}{4}$.
Fifth, if $n\in\{0,1,\dots,\frac{p-7}{4} \}$, then the norm of $n+\frac{1+\sqrt{-p}}{2}$ is a prime number.
Sixth, $n^2+n+\frac{p+1}{4}$ is a prime number for all $x\in\{0,1,\dots,\frac{p-7}{4} \}$.
I have written the details for parts 3 (supposing there is a prime number that divides it, and obtaining a contradiction) and 4 (using the second and third statements). Part 6 is trivial (since the norm of $n+\frac{1+\sqrt{-p}}{2}$ is $n^2+n+\frac{p+1}{4}$) once part 5 has been proved.
However, I'm stuck with parts 1,2 and 5. Regarding part 5, I have tried bounding the norm for the case $n=\frac{p-7}{4}$, but to no avail.
EDIT: as I said in the comments, I forgot to mention that we are considering the cases in which $\mathcal O _K$ is a PID.