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 A020473 #31 Dec 28 2024 11:44:35
%S A020473 1,2,3,5,6,13,14,24,34,60,61,168,169,252,627,1011,1012,2430,2431,7212,
%T A020473 15024,16553,16554,50219,60008,64284,92071,260178,260179,844846,
%U A020473 844847,1431187,2608883,2661217,7946814,22692855,22692856,22911815,36004488,120859171
%N A020473 Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n.
%C A020473 Number of ways to represent 1 = Sum_{k=1..n} b(k)/k, where the b(k) >= 0. - _Franklin T. Adams-Watters_, Aug 01 2006
%H A020473 Toshitaka Suzuki, <a href="/A020473/b020473.txt">Table of n, a(n) for n = 1..390</a>
%H A020473 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F A020473 a(n) = Sum(A092666(i), i=1..n).
%F A020473 For prime p, a(p) = a(p-1) + 1. - _Max Alekseyev_, May 07 2012
%t A020473 Table[Length[IntegerPartitions[1, All, 1/Range[n]]], {n, 1, 20}] (* _Ben Branman_, Apr 21 2012 *)
%Y A020473 Cf. A038034, A092666, A092670, A208480.
%K A020473 nonn
%O A020473 1,2
%A A020473 _David W. Wilson_