a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders.
A049850
a(n) is the number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =1a(8) =0a(9) =2a(10) =2a(11) =0a(12) =2a(13) =1a(14) =1a(15) =4a(16) =3a(17) =3a(18) =3a(19) =1a(20) =5a(21) =3a(22) =3a(23) =4a(24) =4a(25) =5a(26) =10a(27) =8a(28) =5a(29) =6
External references
- oeis: A049850