I consider the sequence of composite odd integers: 9, 15, 21, 25, 27, 33, 35, 41, ...
I observe that there are certain large gaps between the composite odd integers and this may contribute towards the solution.
So I start by considering some sums first:
9 + 9 + 9 = 27, 9 + 9 + 15 = 33. So this means that 31 is potentially such a prime number.
Then I consider other sums and manage to obtain 39, 43 and 45. So now 41 becomes the potential contender.
But this method is clearly just trial and error. Is there a more elegant method?