login
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.
2

%I #14 Aug 08 2021 08:38:21

%S 0,0,0,0,0,0,0,1,0,2,2,0,2,1,1,4,3,3,3,1,5,3,3,4,4,5,10,8,5,6,6,8,5,

%T 12,7,11,9,7,9,14,8,13,7,11,14,11,5,16,14,9,14,12,8,14,7,8,17,15,11,

%U 14,13,15,12,11,13,19,19,22,16,19,16,10,15,15,14,15

%N 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.

%e For prime(10)=29, the primes counted are 11 and 17.

%Y Cf. A049848, A049849.

%K nonn

%O 1,10

%A _Clark Kimberling_

%E More terms from _Sean A. Irvine_, Aug 07 2021