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 A270429 #10 Jul 13 2016 12:55:01
%S A270429 1,2,4,5,9,8,15,13,17,18,28,19,34,30,31,33,48,34,54,39,47,56,69,45,67,
%T A270429 68,67,63,91,62,97,77,88,96,91,75,121,108,106,89,137,94,144,115,111,
%U A270429 138,159,105,149,134,147,141,181,134,155,139,168,182,205,131
%N A270429 Minimal total number of unit fractions required to sum up all fractions 1/n, 2/n, ..., n/n.
%F A270429 a(n) = Sum_{k=1..n} A097847(n,k). - _Alois P. Heinz_, Jul 12 2016
%e A270429 For n = 3: 1/3 and 3/3 = 1/1 are unit fractions themselves. 2/3 can be generated as the sum of two unit fractions: 1/2 + 1/6. This gives us a(3) = 1 + 2 + 1 = 4.
%Y A270429 Row sums of A097847.
%K A270429 nonn
%O A270429 1,2
%A A270429 _Carsten Peust_, Jul 12 2016