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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,13
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:28 EDT 2024. Contains 371916 sequences. (Running on oeis4.)