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 A100678 #27 Sep 18 2022 09:03:31
%S A100678 1,2,2,3,2,3,3,3,3,4,3,4,4,3,4,5,3,4,4,4,4,5,3,4,4,4,4,5,4,6,4,4,5,5,
%T A100678 4,5,5,5,4,5,3,4,4,4,4,5,4,4,5,4,5,5,4,5,4,5,5,5,4,5,6,4,5,5,5,6,5,5,
%U A100678 4,6,5,5,5,5,5,5,4,5,6,6,5,6,4,5,6,5,6,6,5,4,5,5,5,5,5
%N A100678 Number of Egyptian fractions in the representation of n/(n+1) via the greedy algorithm.
%C A100678 a(n) = length of n-th row in table A247765. - _Reinhard Zumkeller_, Sep 25 2014
%H A100678 Seiichi Manyama, <a href="/A100678/b100678.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..100 from Reinhard Zumkeller)
%H A100678 Wikipedia, <a href="https://en.wikipedia.org/wiki/Greedy_algorithm_for_Egyptian_fractions">Greedy algorithm for Egyptian fractions</a>
%e A100678 a(16) = 5 because 16/17 = 1/2 + 1/3 + 1/10 + 1/128 + 1/32640.
%o A100678 (PARI) A100678(n)={ my(x = n/(n+1), nb = 1); while(x -= 1/ceil(1/x), nb++); nb} \\ _Michel Marcus_, Aug 12 2013, minor edits by _M. F. Hasler_, Sep 25 2014
%o A100678 (Haskell)
%o A100678 a100678 = length . a247765_row -- _Reinhard Zumkeller_, Sep 25 2014
%Y A100678 Cf. A100695.
%Y A100678 Cf. A247765.
%K A100678 nonn
%O A100678 1,2
%A A100678 _Pahikkala Jussi_, Dec 06 2004
%E A100678 More terms from _M. F. Hasler_, Sep 25 2014