Here you can find the number of Goldbach partitions of an even number. $r(190)=8$, $r(50)= 5$ and so on.
Now $r(4)=r(6)=r(8)=r(12)=1$. Here is my question. Is there any $n>6$ which yields $r(2n)=1$. I tried all $n$ values for $n<96$ and didn't found any.
And is there any research on this function's behaviour?