A071840 - OEIS

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

A071840

Number of primes == 3 mod 8 <= n.

0

0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7

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

OFFSET

1,11

LINKS

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

PROG

(PARI) for(n=1, 200, print1(sum(i=1, n, if((i*isprime(i)-3)%8, 0, 1)), ", "))

CROSSREFS

Sequence in context: A086007 A108582 A345378 * A000193 A059939 A071842

Adjacent sequences: A071837 A071838 A071839 * A071841 A071842 A071843

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, Jun 08 2002

STATUS

approved