A049849 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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.

2

0, 0, 0, 0, 1, 1, 1, 1, 4, 2, 2, 3, 1, 3, 6, 7, 5, 5, 4, 8, 5, 5, 10, 9, 6, 4, 5, 7, 8, 9, 6, 8, 8, 6, 8, 7, 5, 8, 9, 10, 13, 7, 10, 9, 8, 9, 8, 7, 7, 11, 11, 14, 13, 14, 15, 15, 8, 9, 12, 5, 17, 15, 9, 12, 9, 10, 5, 8, 9, 14, 12, 16, 15, 12, 9, 16, 18, 12, 11

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,9

LINKS

Table of n, a(n) for n=1..79.

EXAMPLE

For prime(9)=23, the primes counted are 5,13,17,19.

CROSSREFS

Cf. A049848, A049850.

Sequence in context: A341859 A058634 A037919 * A112349 A231821 A062072

Adjacent sequences: A049846 A049847 A049848 * A049850 A049851 A049852

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from Sean A. Irvine, Aug 07 2021

STATUS

approved