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

A049849

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

Terms

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

External references