login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030659 Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions. 5

%I #38 Mar 12 2021 09:31:39

%S 6,12,15,15,18,20,24,24,28,30,33,33,35,36,40,42,48,52,52,54,55,55,56,

%T 60,63,72,75,75,76,76,77,78,80,85,85,88,90,95,96,96,100,102,104,104,

%U 108,110,114,115,115,119,119,120,126,130,132,135,138,143,144,144

%N Smallest possible maximum denominator in an expression for 1 as a sum of n distinct unit (Egyptian) fractions.

%D R. K. Guy (1981): Unsolved Problems In Number Theory, D11, also p. 161.

%H Tatsuru Watanabe, <a href="/A030659/b030659.txt">Table of n, a(n) for n = 3..147</a>

%H 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. <a href="http://www.jstor.org/stable/10.4169/college.math.j.43.4.337">Solution</a> published in Vol. 43, No. 4, September 2012, pp. 340-342.

%H David Eppstein, <a href="http://www.ics.uci.edu/~eppstein/numth/egypt/kterm-minden.html">Unit Fractions, smallest last term</a>

%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>

%Y Cf. A213062. - _Alois P. Heinz_, Sep 21 2012

%K nonn,hard

%O 3,1

%A _Dan Hoey_

%E More terms from _Jon E. Schoenfield_, Mar 24 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)