Number of ways in which 2n-1 can be written as the sum of 3 odd composite numbers 9 <= u <= v <= w.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 3, 0, 1, 4, 1, 2, 5, 2, 2, 7, 3, 4, 9, 3, 5, 12, 4, 8, 13, 6, 10, 15, 8, 11, 18, 11, 12, 24, 11, 15, 27, 14, 19, 29, 17, 23, 32, 22, 24, 37, 26, 28, 43, 26, 31, 51, 30, 38, 53, 33, 43, 58, 40, 47

1

Complement of the ternary Goldbach problem; instead of writing an odd number as the sum of three primes, we write it as the sum of odd composite numbers. The following numbers have just one representation: 27, 33, 43, 49, and 53. Odd numbers less than 27 have zero representations.

T. D. Noe, Plot of 1000 terms

T. D. Noe, Table of 1000 terms

Harald Andres Helfgott, The ternary Goldbach problem, arXiv 1501.05438

(Mma) nn = 200; ps = Prime[Range[PrimePi[nn]]]; oddNP = Complement[Range[9, nn, 2], ps]; Table[Length[IntegerPartitions[p, {3}, oddNP]], {p, 1, nn, 2}]

Cf. A024681 (primes instead of odd numbers 2n-1), S000456, S000458, S000459.

nonn

T. D. Noe, Jan 24 2015