Here is my version of the table that Tito Piezas III presented in his answer.
Initially I wrote the wrong code (using computer algebra Reduce) and wondered why I didn't get the same numbers as in Tito's table, then I realized that I was computing the number of pairs, for the first 10000 primes $p\ge3$ such that the next prime was a given distance $m$ from $p$ (e.g., distance $2,4, ...,36$). This number of primes is in column $K$ in the table below (whereas column $N$ is the number of pairs, for the first 10000 primes $p\ge3$ such that $p+m$ is also a prime). For instance, the prime $101$ is counted, when $m=6$, in column $N$ since $101+6=107$ is also a prime, but not counted in column $K$ since the next prime after $101$ is $103$ which is not distance $6$ from $101.$
\begin{array}{|c|c|c|}
\hline
m&N&K\\
\hline
2&1270&1270\\
4&1264&1263\\
6&\color{blue}{2538}&\color{blue}{2012}\\
8&1303&801\\
10&1682&953\\
12&\color{blue}{2515}&\color{green}{1008}\\
14&1546&513\\
16&1275&354\\
18&\color{blue}{2569}&\color{green}{537}\\
20&1701&249\\
22&1403&235\\
24&\color{blue}{2578}&\color{green}{222}\\
26&1402&91\\
28&1519&102\\
30&\color{red}{3451}&\color{green}{154}\\
32&1246&35\\
34&1357&36\\
36&\color{blue}{2561}&\color{green}{55}\\
\hline
\end{array}
It seems interesting that $N$ is about the same for all $m$ that are multiples of $6$, up to $m=36$, except for a spike at $m=30$ (this may have something to do with $30$ being divisible by the small prime $5$ (in addition to $2$ and $3$) whereas $6,12,18,24,36$ each is divisible only by primes $2,3$). I feel that a form of the pigeon-hole principle is relevant, if you put this many primes into this little space, some distances between these primes ought to repeat.