login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A281532 a(n) = least numerator X such that the proper fraction X/A281529(n) needs n or more terms to be written as a signed sum of distinct unit fractions. 1
1, 2, 5, 18, 118 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Sierpiński conjectured that for any integer n > 3 there exist positive integers a, b, c so that 5/n = 1/a + 1/b + 1/c. If the conjecture is true, then 5 appears only once in the sequence.

REFERENCES

W. Sierpiński, O rozkładach liczb wymiernych na ułamki proste, PWN, Warsaw, Poland, 1957, pp. 96-100.

LINKS

Table of n, a(n) for n=1..5.

CROSSREFS

See A281529 for denominators.

Sequence in context: A058338 A006896 A125625 * A097584 A197855 A289126

Adjacent sequences:  A281529 A281530 A281531 * A281533 A281534 A281535

KEYWORD

nonn,frac,hard,more

AUTHOR

Arkadiusz Wesolowski, Jan 23 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 17:59 EST 2020. Contains 331051 sequences. (Running on oeis4.)