%I #12 Jul 28 2015 18:51:04
%S 1,1,1,2,1,7,1,10,10,26,1,107,1,83,375,384,1,1418,1,4781,7812,1529,1,
%T 33665,9789,4276,27787,168107,1,584667,1,586340,1177696,52334,5285597,
%U 14746041,1,218959,13092673,84854683,1,279357910,1,491060793,2001103921
%N a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), with 0 < x_1 <= ... <= x_k = n.
%H Toshitaka Suzuki, <a href="/A092666/b092666.txt">Table of n, a(n) for n = 1..390</a>
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F a(n) = A020473(n) - A020473(n-1).
%F a(n) = 1 if n is prime.
%e a(4) = 2 since there are two fractions 1=1/2+1/4+1/4 and 1=1/4+1/4+1/4+1/4.
%Y Cf. A020473, A092667, A092669, A002966, A000058, A259633.
%K nonn
%O 1,4
%A _Max Alekseyev_, Mar 02 2004
%E Edited by _Max Alekseyev_, May 05 2010