The formula is:
P(n+1) modulo the digit-sum of P(n), where P(n) is the nth prime
The clue that gave it away was that the first few terms are
The difference between consecutive primes, which agrees with the modulo function whenever the numbers are close enough (the larger one is less than twice the smaller one).
Also,
Since the behaviour changes when the primes reach two digits, this points to some kind of operation that depends on the number of digits (and since things that involve the decimal number system are not very relevant to mathematics in general, this may explain why such a simple sequence is not found on the OEIS)