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

Terms

a(0) =0a(1) =0a(2) =1a(3) =1a(4) =1a(5) =1a(6) =2a(7) =1a(8) =2a(9) =1a(10) =1a(11) =2a(12) =2a(13) =1a(14) =2a(15) =2a(16) =2a(17) =1a(18) =2a(19) =2a(20) =1a(21) =2a(22) =1a(23) =2a(24) =2a(25) =2a(26) =1a(27) =3a(28) =1a(29) =2