The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255472 Number of decompositions of 2n into sums of two primes p <= q such that one or both p and q are elements of A023201. 1
 0, 0, 0, 1, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 1, 4, 4, 1, 3, 4, 3, 3, 4, 4, 3, 5, 3, 3, 6, 1, 5, 6, 2, 5, 5, 4, 5, 6, 4, 4, 8, 4, 3, 8, 3, 5, 7, 2, 5, 7, 5, 6, 6, 6, 6, 9, 5, 4, 12, 3, 5, 10, 2, 5, 7, 6, 5, 6, 6, 5, 11, 5, 4, 11, 2, 8, 8, 3, 7, 10, 5, 4, 9, 8, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Conjecture: for all n > 3, a(n) > 0. If 2n = p + q and p+6 is also a prime, 2n+6 can be written as the sum of two primes p+6 and q. The conjecture is weaker than a conjecture of Sun posed in 2012 (see A219055). - Zhi-Wei Sun, Mar 18 2015 LINKS Lei Zhou, Table of n, a(n) for n = 1..10000 Lei Zhou, Plot for 0

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 May 18 11:30 EDT 2021. Contains 343995 sequences. (Running on oeis4.)