login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204814 Number of decompositions of 2n into an unordered sum of two Ramanujan primes. 5
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: A186717 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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 24 02:16 EDT 2013. Contains 225613 sequences.