The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A340767 Number of primes p <= 6*n + 5 that are congruent to 2 modulo 3. 2
2, 3, 4, 5, 6, 6, 7, 8, 9, 10, 10, 11, 11, 12, 13, 13, 14, 15, 16, 16, 16, 17, 18, 18, 19, 19, 19, 20, 21, 22, 22, 23, 24, 24, 24, 24, 24, 25, 26, 27, 27, 28, 29, 30, 31, 31, 32, 32, 33, 33, 33, 34, 35, 35, 35, 35, 35, 36, 37, 38, 38, 38, 38, 39, 40, 40, 41, 41, 41, 42, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = A340764(6*n+5).
a(n) = 1 + Sum_{k=0..n+1} A167020(k).
EXAMPLE
There are 14 primes <= 6*16+5 = 101 that are congruent to 2 modulo 3, namely 2, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, so a(16) = 14.
PROG
(PARI) a(n) = sum(i=1, 6*n+5, isprime(i) && (i%3==2))
CROSSREFS
Sequence in context: A278055 A291764 A319681 * A099848 A082287 A331267
KEYWORD
nonn,easy
AUTHOR
Jianing Song, Apr 28 2021
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 May 21 17:00 EDT 2024. Contains 372738 sequences. (Running on oeis4.)