I saw this question showing how you can generate a sequence of n non-prime numbers in a row: Intervals that are free of primes
It would be of the form: $$(n+2)! + 2, (n+2)! + 3, \ldots, (n+2)! + (n+2)$$
I was wondering about a similar interval but with the condition that it must be surrounded by primes. The term before is prime and the term after is also prime. This can only be true when n is odd as if it was even either the beginning or last term would have to be even and therefore it would not be surrounded by primes.
Eg. the condition would be met when:
n=1 -> 3,4,5
n=3 -> 13,14,15,16,17
n=5 -> 23,24,25,26,27,28,29
I was wondering if it is possible to prove that such an interval exists for all odd numbers n.