A039736 a(n) = number of primes q<p having (p mod q) = 2, where p = n-th prime.

0, 0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 3, 2, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 2, 1, 2, 3, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 3, 2, 2, 3, 1, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 3, 1, 2, 2, 2, 3, 2, 1, 3, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 3, 2, 1