This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A092670 #9 Mar 30 2012 17:26:51 %S A092670 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 A092670 114,200,200,200,363,363,566,852,852,852,852,1655,1655,3054,3054,3054, %U A092670 5777,5777,5777,10647,10647,10647,10647,19436,19436,33373,48360,90441 %N A092670 a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n. %H A092670 Toshitaka Suzuki, <a href="/A092670/b092670.txt">Table of n, a(n) for n = 1..610</a> %H A092670 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a> %F A092670 a(n)=Sum(A092669(i), i=1..n) %e A092670 a(6)=2 since there are two fractions 1=1/1 and 1=1/2+1/3+1/6. %Y A092670 Cf. A020473, A038034, A092669, A006585. %K A092670 nonn %O A092670 1,6 %A A092670 _Max Alekseyev_, Mar 02 2004 %E A092670 More terms from T. Suzuki (suzuki(AT)scio.co.jp), Nov 24 2006