A049848 a(n)=number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 2 nonzero remainders.

0, 0, 1, 1, 1, 2, 4, 3, 2, 3, 2, 4, 6, 5, 3, 2, 5, 3, 5, 5, 5, 6, 3, 6, 6, 7, 5, 5, 6, 5, 7, 4, 7, 5, 8, 4, 8, 6, 5, 4, 4, 7, 6, 6, 8, 7, 7, 9, 10, 7, 6, 4, 9, 7, 8, 9, 7, 7, 6