|
|
A030659
|
|
Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions.
|
|
5
|
|
|
6, 12, 15, 15, 18, 20, 24, 24, 28, 30, 33, 33, 35, 36, 40, 42, 48, 52, 52, 54, 55, 55, 56, 60, 63, 72, 75, 75, 76, 76, 77, 78, 80, 85, 85, 88, 90, 95, 96, 96, 100, 102, 104, 104, 108, 110, 114, 115, 115, 119, 119, 120, 126, 130, 132, 135, 138, 143, 144, 144
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
REFERENCES
|
R. K. Guy (1981): Unsolved Problems In Number Theory, D11, also p. 161.
|
|
LINKS
|
Mohammad K. Azarian, Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Problem 958, College Mathematics Journal, Vol. 42, No. 4, September 2011, p. 330. Solution published in Vol. 43, No. 4, September 2012, pp. 340-342.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|