a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0
1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 3, 0, 0, 5, 0, 11, 0, 0, 0, 19, 0, 0, 0, 73, 0, 86, 0, 0
2 seqfan posts
Tue May 22 15:28:53 CEST 2012 [seqfan] Re: Integer sequence question at MathOverflow