[seqfan] Re: Integer sequence question at MathOverflow

Max Alekseyev maxale at gmail.com
Wed May 23 00:14:38 CEST 2012

On Tue, May 22, 2012 at 5:28 PM, Max Alekseyev <maxale at gmail.com> wrote:
> This approach suggests the following sequence:
> a(n) is the number of distinct fractions <=1 that can be obtained by
> summing up reciprocals of integers <= n. (Basically it is the size of
> dynamic programming table in Suzuki's approach).
> Is it present in the OEIS? If not, could somebody please compute and submit it?

I've computed some initial terms and added them as sequence A212606.
Please extend.

The sequence apparently grows quite fast so I still do not understand
how Suzuki Toshitaka computed so many terms of A020473.


More information about the SeqFan mailing list