References to A112801

Number of ways of representing 2n-1 as sum of three integers with 2 distinct prime factors.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 2, 2, 4, 4, 4, 8, 7, 8, 11, 11, 13, 15, 16, 18

1 seqfan posts