Let $d_k$ be the $k^{th}$ difference sequence of the primes; that is, $$d_k = \sum_{i=0}^{k} (-1)^i {k \choose i} P_{k+1-i},$$ where $P_i$ denotes the $i$-th prime number. Let $(s_n)$ be the increasing sequence of all $k$ satisfying $d_k > 0.$ Is $s_{n+1} - s_n \in \{1,2,3\}$ for every $n$?
Here's some initial evidence: $$d_1 = 3 - 2 = 1$$ $$d_2 = (5-3) - (3-2) = 1$$ $$d_3 = 7 - 3\cdot5 + 3\cdot3 - 2 = -1$$ $$d_4 = 11 - 4\cdot7 + 6\cdot5 - 4\cdot3 + 2 = 3,$$ and so on, so that $(s_n) = (1,2,4,6,8,10,12,14,15,17,19,...).$ For $n$ up to $2000$, my computer finds $s_{n+1} - s_n = 1$ for $15$ values of $n$$; $ $s_{n+1} - s_n = 2$ for $976$ values; and $s_{n+1} - s_n = 3$ for $10$ values.