Template:Sequence of the Day for July 18

Intended for: July 18, 2012

Timetable

• First draft entered by Alonso del Arte on April 29, 2011 based on a verbatim copy of a write-up from November 8, 2010. ✓
• Draft reviewed by Alonso del Arte on July 15, 2011 ✓
• Draft approved by Daniel Forgues on June 20, 2011 ✓

Yesterday's SOTD * Tomorrow's SOTD

The line below marks the end of the <noinclude> ... </noinclude> section.

---

A002372: Number of decompositions of

2 n, n   ≥   1,

into ordered sums of two odd primes.

{ 0, 0, 1, 2, 3, 2, 3, 4, 4, ... }

If the Goldbach conjecture is true, then

a (n) > 0

for all

n > 2

.

Note that this sequence does not require the primes to be distinct to be counted, and counts solutions with distinct primes twice (for example, for 8, both 3 + 5 and 5 + 3 are counted).

Also note that in the b-file, for above [about]

n = 3000

, all values of this sequence are over a hundred.