MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I was amazed to discover that sequence in the OEIS has almost four hundred terms computed.

I wonder how one can get that far? E.g., how one can compute A020473(100)?

P.S. There was a related question Diophantine equation: Egyptian fraction representations of 1 about Egyptian fractions with a fixed number of reciprocals (with unbounded denominators) for which there seemed to be no efficient counting algorithm (to compute hundreds of terms) known. I found it interesting how complexity of these two problems differ.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.