The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A204814 Number of decompositions of 2n into an unordered sum of two Ramanujan primes. 6
 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 3, 0, 0, 1, 0, 0, 2, 0, 0, 2, 1, 0, 2, 1, 0, 3, 0, 0, 1, 1, 0, 2, 0, 0, 1, 2, 0, 2, 2, 0, 4, 0, 0, 1, 2, 0, 2, 0, 1, 1, 3, 0, 2, 2, 0, 2, 0, 0, 1, 2, 0, 2, 1, 1, 2, 4, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,29 COMMENTS Suggested by John W. Nicholson. There are 95 zeros in the first 10000 terms. Are there more? Related to Goldbach's conjecture. - T. D. Noe, Jan 27 2012 There are no other zeros in the first 10^8 terms. a(n) > 0 for n from 1313 to 10^8. - Donovan Johnson, Jan 27 2012 LINKS Donovan Johnson, Table of n, a(n) for n = 1..10000 EXAMPLE a(29) = 3. 2*29 = 58 = 11+47 = 17+41 = 29+29 (11, 17, 29, 41 and 47 are all Ramanujan primes). 58 is the unordered sum of two Ramanujan primes in three ways. CROSSREFS Cf. A045917, A104272, A173634. Sequence in context: A305802 A186038 A091009 * A174903 A167163 A005890 Adjacent sequences: A204811 A204812 A204813 * A204815 A204816 A204817 KEYWORD nonn AUTHOR Donovan Johnson, Jan 27 2012 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.

Last modified December 3 13:06 EST 2022. Contains 358524 sequences. (Running on oeis4.)