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 A050205 #34 Feb 16 2025 08:32:40 %S A050205 1,1,2,1,1,2,1,2,2,3,1,1,1,2,2,1,2,3,2,3,3,1,1,2,1,2,2,3,1,2,1,2,2,2, %T A050205 3,3,1,1,2,2,1,2,2,3,3,1,2,2,2,3,2,3,4,4,4,1,1,1,1,2,1,2,2,2,2,3,1,2, %U A050205 3,3,3,3,2,3,3,3,3,4,1,1,2,2,2,3,1,2,2,3,3,3,4,1,2,1,2,1,2,3,2,2,2,3 %N A050205 Triangle read by rows: number of terms in unit fraction representation of k/n using the greedy algorithm, 1<=k<=n-1. %H A050205 Seiichi Manyama, <a href="/A050205/b050205.txt">Rows n = 2..141, flattened</a> %H A050205 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UnitFraction.html">Unit Fraction</a>. %H A050205 Wikipedia, <a href="https://en.wikipedia.org/wiki/Greedy_algorithm_for_Egyptian_fractions">Greedy algorithm for Egyptian fractions</a>. %e A050205 2/3 = 1/2 + 1/6. So T(3,2) = 2. %e A050205 n\k | 1 2 3 4 5 6 7 8 %e A050205 ----*------------------------ %e A050205 2 | 1; %e A050205 3 | 1, 2; %e A050205 4 | 1, 1, 2; %e A050205 5 | 1, 2, 2, 3; %e A050205 6 | 1, 1, 1, 2, 2; %e A050205 7 | 1, 2, 3, 2, 3, 3; %e A050205 8 | 1, 1, 2, 1, 2, 2, 3; %e A050205 9 | 1, 2, 1, 2, 2, 2, 3, 3; %Y A050205 Cf. A050206, A050210 (Largest denominator), A260618. %K A050205 nonn,easy,tabl %O A050205 2,3 %A A050205 _Eric W. Weisstein_ %E A050205 Offset changed to 2 by _Seiichi Manyama_, Sep 18 2022