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 A075785 #12 Sep 23 2021 05:20:42
%S A075785 0,1,1,3,7,6,6,16,15,15,13,22,8,27,30,26,21,45,8,59,36,29,20,62,32,45,
%T A075785 69,67,27,84,14,59,56,44,129,142,15,45,53,130,31,124,21,131,178,40,29,
%U A075785 118,38,88,67,102,43,191,102,180,74,57,43,274,21,75,227,86,144,145,23,121,87
%N A075785 Number of ways to express 3/n as Egyptian fractions in just three terms.
%H A075785 Christian Elsholtz, <a href="http://www.ams.org/tran/2001-353-08/S0002-9947-01-02782-9/home.html">Sums Of k Unit Fractions</a>
%H A075785 David Eppstein, <a href="http://www.ics.uci.edu/~eppstein/numth/egypt/intro.html">Algorithms for Egyptian Fractions</a>
%t A075785 Needs["MyOwn`Egypt`"]; Table[ Length[ EgyptianFraction[3/n, Method -> Lexicographic, MaxTerms -> 3, MinTerms -> 3, Duplicates -> Disallow, OutputFormat -> Plain]], {n, 5, 70}]
%t A075785 f[n_] := Length@ Solve[3/n == 1/x + 1/y + 1/z && 0 < x < y < z, {x, y, z}, Integers]; Array[f, 69] (* _Robert G. Wilson v_, Jul 17 2013 *)
%Y A075785 Cf. A073101, A347566, A347569.
%K A075785 nonn
%O A075785 1,4
%A A075785 _Robert G. Wilson v_, Aug 18 2002