Number of (unordered) ways of writing 2n+1 as a sum of 3 odd primes.

Terms

a(0) =0a(1) =0a(2) =0a(3) =0a(4) =1a(5) =1a(6) =2a(7) =2a(8) =3a(9) =3a(10) =4a(11) =4a(12) =5a(13) =6a(14) =7a(15) =6a(16) =8a(17) =7a(18) =9a(19) =10a(20) =10a(21) =10a(22) =11a(23) =12a(24) =12a(25) =14a(26) =16a(27) =14a(28) =16a(29) =16