A039737 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A039737

a(n)=number of primes q<p having (p mod q)=3, where p=n-th prime.

0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2

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

OFFSET

1,21

LINKS

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

CROSSREFS

Sequence in context: A238900 A037832 A170977 * A144382 A139553 A078379

Adjacent sequences: A039734 A039735 A039736 * A039738 A039739 A039740

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved