Average order and upper bound of $r_{0}(n)$

Assume Goldbach's conjecture. Then for every integer $n>1$ there exists a non-negative integer $r$ such that $n-r$ and $n+r$ are both primes. For a given $n>1$, the smallest such $r$ will be denoted as $r_{0}(n)$. Let's now define the quantity $k_{0}(n)$ as $k_{0}(n):=\pi(n+r_{0}(n))-\pi(n-r_{0}(n))$. One can easily figure out that the number of integers $x$ below $n$ such that $k_{0}(x)=1$ is equal to $\pi(n)+O(1)$. One can write the following equality:
$$r_{0}(n)=\sum_{k_{0}(m)=1, \vert n-m\vert\leqslant r_{0}(n)}r_{0}(m)$$

One can deduce from the PNT that the average order of $r_{0}(m)$, denoted by $\langle r_{0}(m)\rangle$, verifies $\langle r_{0}(m)\rangle\sim \frac{1}{2}\log m$. If one can prove that $\displaystyle{\dfrac{1}{2r_{0}(n)}\sum_{k_{0}(m)=1, \vert n-m\vert\leqslant r_{0}(n)}1\sim\frac{1}{\log n}}\ \ (*)$, then one gets that $\langle r_{0}(m)\rangle\sim\dfrac{1}{\log n}r_{0}(n)$ and thus the average order of $r_{0}(n)$, denoted by $\langle r_{0}(n)\rangle$, verifies $\langle r_{0}(n)\rangle\sim\frac{1}{2}\log^{2}n$.

Now let $\displaystyle{r_{0,min}(n):=\inf_{x\leqslant 2n}r_{0}(x)}$ and $\displaystyle{r_{0,max}(n):=\sup_{x\leqslant 2n}r_{0}(x)}$. Is it true that $\langle r_{0}(n)\rangle\sim \dfrac{r_{0,min}(n)+r_{0,max}(n)}{2}$?
If so, one could get under Goldbach's conjecture and provided $(*)$ is true that $\displaystyle{\lim\sup_{n\to\infty}\dfrac{r_{0}(n)}{\log^{2}n}=1}$.

EDIT March 24th 2014: the quantity $\sum_{k_{0}(m)=1, |n-m|\leqslant r_{0}(n)}1$ is simply $k_{0}(n)$. As $\dfrac{2r_{0}(n)}{k_{0}(n)}$ is the average gap between two consecutive primes of size $n$, $(*)$ holds true. So that it's very likely that Goldbach's conjecture alone implies Cramer's conjecture.

-
I suspect that if it were true that Goldbach implies Cramer then we'd know it by now. Anyway, it should be easy to concoct a sequence of integers that satisfy Goldbach but not Cramer. –  Gerry Myerson Mar 25 at 2:10
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.996802031993866, "perplexity": 104.5020191250647}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-42/segments/1413507447020.15/warc/CC-MAIN-20141017005727-00179-ip-10-16-133-185.ec2.internal.warc.gz"}