STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A049850
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
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.
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed
NAME
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.
EXAMPLE
Example: for pFor prime(10)=29, the primes counted are 11 and 17.
STATUS
proposed
editing
STATUS
editing
proposed
NAME
a(n) = number of primes q less than n-th prime p for which the Euclidean algorithm for p,q has exactly 4 nonzero remainders.
DATA
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, 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, 14, 13, 15, 12, 11, 13, 19, 19, 22, 16, 19, 16, 10, 15, 15, 14, 15
EXTENSIONS
More terms from Sean A. Irvine, Aug 07 2021
STATUS
approved
editing