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 A286720 #32 Oct 15 2023 05:13:42
%S A286720 4,6,6,4,6,6,4,6,6,6,8,6,6,10,6,6,8,6,12,10,10,4,6,6,6,8,6,6,8,10,6,6,
%T A286720 8,8,6,10,6,8,6,8,6,10,6,10,6,10,6,10,6,8,8,6,8,8,8,6,6,6,10,8,6,8,10,
%U A286720 12,8,10,6,8,8,8,10,8,6,8,10,6,8,8,6,6,8
%N A286720 Number of Egyptian fractions in the representation of 1-1/(2n+1) by the odd greedy expansion algorithm, without repeats.
%C A286720 The odd version of A100678.
%H A286720 Amiram Eldar, <a href="/A286720/b286720.txt">Table of n, a(n) for n = 1..10000</a>
%H A286720 Kevin Brown, <a href="http://www.mathpages.com/home/kmath478.htm">Odd-Greedy Unit Fraction Expansions</a>.
%H A286720 Wikipedia, <a href="http://en.wikipedia.org/wiki/Odd_greedy_expansion">Odd greedy expansion</a>.
%e A286720 For n = 1, 1-1/(2n+1) = 2/3 = 1/3 + 1/5 + 1/9 + 1/45 has 4 fractions in the representation, thus a(1) = 4.
%t A286720 odd[n_]:=If[OddQ[n],n,n+1];a={};For[n=0,n<100,n++;lst={};k=2n/(2n+1);s1=0; While[k>0,s2=odd[Ceiling[1/k]]; If[s2==s1,s2+=2]; AppendTo[lst, s2]; k=k-1/s2; s1=s2];a=AppendTo[a,Length[lst]]];a
%Y A286720 Cf. A100678.
%K A286720 nonn
%O A286720 1,1
%A A286720 _Amiram Eldar_, May 30 2017