login

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”).

A071841
Number of primes == 5 mod 8 <= n.
0
0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7
OFFSET
1,13
MATHEMATICA
Accumulate[Table[If[PrimeQ[n]&&Mod[n, 8]==5, 1, 0], {n, 110}]] (* Harvey P. Dale, Apr 28 2018 *)
PROG
(PARI) for(n=1, 200, print1(sum(i=1, n, if((i*isprime(i)-5)%8, 0, 1)), ", "))
CROSSREFS
Sequence in context: A054900 A046042 A287866 * A355478 A097876 A177830
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 08 2002
STATUS
approved