The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A280667 a(n) = number of primes of the form 4k + 1 such that 2n - 4k - 1 is prime. 1
 0, 0, 0, 1, 1, 1, 0, 2, 2, 2, 2, 3, 1, 2, 2, 2, 3, 4, 0, 3, 4, 3, 4, 5, 2, 3, 4, 3, 5, 6, 0, 5, 6, 2, 4, 6, 3, 5, 6, 4, 3, 8, 2, 4, 6, 4, 4, 7, 2, 6, 8, 5, 5, 8, 4, 7, 10, 6, 6, 12, 3, 5, 10, 3, 6, 9, 4, 5, 6, 7, 8, 11, 3, 5, 10, 4, 8, 11, 2, 8, 10, 5, 6, 13, 6, 6, 8, 7, 7, 14, 2, 8, 12, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Primes p such that a(p) = 0: 2, 3, 7, 19, 31. LINKS EXAMPLE a(8) = 2 because 2*8 - 4*1 - 1 = 11 is prime where 4*1 + 1 = 5 is prime of the form 4k+1 and 2*8 - 4*3 - 1 = 3 is prime where 4*3 + 1 = 13 is prime of the form 4k+1. PROG (MAGMA)  A280667 := func; [A280667(n):n in[1..100]]; (PARI) a(n) = sum(k=1, 2*n, isprime(k) && isprime(2*n-k) && ((2*n-k) % 4 == 1)); \\ Michel Marcus, Jan 07 2017 CROSSREFS Cf. A002144, A035026, A278287, A279027. Sequence in context: A212355 A238646 A194330 * A194286 A063473 A096859 Adjacent sequences:  A280664 A280665 A280666 * A280668 A280669 A280670 KEYWORD nonn AUTHOR Juri-Stepan Gerasimov, Jan 07 2017 STATUS approved

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

Last modified December 1 07:59 EST 2021. Contains 349426 sequences. (Running on oeis4.)