|
%I #9 Mar 30 2012 17:26:51
%S 1,1,1,1,1,2,2,2,2,2,2,3,3,3,6,6,6,11,11,22,22,22,22,41,41,41,41,114,
%T 114,200,200,200,363,363,566,852,852,852,852,1655,1655,3054,3054,3054,
%U 5777,5777,5777,10647,10647,10647,10647,19436,19436,33373,48360,90441
%N a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n.
%H Toshitaka Suzuki, <a href="/A092670/b092670.txt">Table of n, a(n) for n = 1..610</a>
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F a(n)=Sum(A092669(i), i=1..n)
%e a(6)=2 since there are two fractions 1=1/1 and 1=1/2+1/3+1/6.
%Y Cf. A020473, A038034, A092669, A006585.
%K nonn
%O 1,6
%A _Max Alekseyev_, Mar 02 2004
%E More terms from T. Suzuki (suzuki(AT)scio.co.jp), Nov 24 2006
|
