The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)
Number of ways to write n as a + b/2 with a and b terms of the sequence A008407.
For every k = 2, ..., 342, the value of A008407(k) has been determined by T. J. Engelsma. Since A008407(343)/2 > A008407(342)/2 = 2328/2 = 1164, if n <= 1166 can be written as A008407(j) + A008407(k)/2 with j > 1 and k > 1 then neither j nor k exceeds 342. Based on this we are able to compute a(n) for n = 1, ..., 1166.