cp's OEIS Frontend

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.

A073546 Triangle read by rows: row n gives denominators of n distinct unit fractions (or Egyptian fractions) summing to 1, where denominators are listed in increasing order and the largest denominator is smallest possible.

This page as a plain text file.
%I A073546 #14 Dec 05 2024 16:47:49
%S A073546 2,3,6,2,4,6,12,2,4,10,12,15,3,4,6,10,12,15,3,4,9,10,12,15,18,3,5,9,
%T A073546 10,12,15,18,20,4,5,8,9,10,15,18,20,24,5,6,8,9,10,12,15,18,20,24,5,6,
%U A073546 8,9,10,15,18,20,21,24,28,6,7,8,9,10,14,15,18,20,24,28,30
%N A073546 Triangle read by rows: row n gives denominators of n distinct unit fractions (or Egyptian fractions) summing to 1, where denominators are listed in increasing order and the largest denominator is smallest possible.
%C A073546 From _Sean A. Irvine_, Dec 05 2024: (Start)
%C A073546 For better versions of this sequence see A216993 and A378723.
%C A073546 This sequence is retained because of the terms given in the Brown link.
%C A073546 There can be more the one solution with the same smallest maximum denominator. For example, if n=8, we have:
%C A073546 1/3 + 1/5 + 1/9 + 1/10 + 1/12 + 1/15 + 1/18 + 1/20 = 1,
%C A073546 1/4 + 1/5 + 1/6 + 1/9 + 1/10 + 1/15 + 1/18 + 1/20 = 1.
%C A073546 The definition of this sequence does not specify which of these should be retained and various rows given here are not consistent in their selection. In A378723, the second solution is taken because 10 < 12 when reading the denominators from the right. In A216993, the first solution is taken because 3 < 4 when reading the denominators from the left. (End)
%D A073546 R. K. Guy, Unsolved Problems in Number Theory, 2nd Edition, page 161.
%H A073546 Mohammad K. Azarian, <a href="http://www.jstor.org/stable/10.4169/college.math.j.42.4.329">Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Problem 958</a>, College Mathematics Journal, Vol. 42, No. 4, September 2011, p. 330.
%H A073546 Mohammad K. Azarian, <a href="http://www.jstor.org/stable/10.4169/college.math.j.43.4.337">Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Solution</a> College Mathematics Journal, Vol. 43, No. 4, September 2012, pp. 340-342.
%H A073546 K. S. Brown, <a href="http://www.ics.uci.edu/~eppstein/numth/egypt/kterm-minden.html">Unit Fractions, smallest last term</a>
%e A073546 n=3: 2,3,6;
%e A073546 n=4: 2,4,6,12;
%e A073546 n=5: 2,4,10,12,15;
%e A073546 n=6: 3,4,6,10,12,15;
%e A073546 ...
%K A073546 nonn,tabf,dead
%O A073546 3,1
%A A073546 _Robert G. Wilson v_, Aug 27 2002
%E A073546 Edited by _Max Alekseyev_, Mar 01 2018