Is there a maximum number of consecutive sexy prime pair sums that are all divisible by $10$? I was finding the sums of pairs of sexy primes (prime numbers that differ by 6) and noticed that there are a lot of pairs who's sum is divisible by $10$.
Ex. $(7, 13)$ as $7+13=20$ and $20$ is divisible by $10$.
I then wondered if there are consecutive sexy prime pairs who's sum is divisible by $10$ and ran some PARI/GP code to find these kind of consecutive pairs. I found upto $17$ consecutive pairs divisible by $10$ on PARI and tested for a search limit of $10^{12}$.
Here is the output I got after running my code, the first column displays the smallest prime of the lowest pair of consecutive sexy primes and the second column displays the number of consecutive pairs divisible by $10$.
7             1 
167           2 
2237          3 
2267          4 
108187        5 
1004057       6 
3281777       7 
32895377      8 
65947927      9
569959037    10 
602817437    11
5476396897   12 
16842019627  13 
16842019637  14 
17004549137  15 
312318208577 16 
382560132847 17 

This leads to my question:

If there are an infinite number of sexy primes, then is there a maximum number of consecutive sexy prime pair sums that are all divisible by $10$?


No-one knows if the supply of sexy primes ever runs out, and this question seems harder.  So here is a guess.
A third of sexy primes has the right sum (ending in 7 and 3, but not 1 and 7, nor 3 and 9), so expect a run of $n$ with the right sum every $3^n$ sexy primes.  
