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

A049848

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

Terms

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

External references