[seqfan] Re: Egyptian Fractions
Alois Heinz
heinz at hs-heilbronn.de
Wed May 5 17:42:44 CEST 2010
You may ask David W. Wilson. He has computed
some of the following sequences:
a(1,n) : A000012 The simplest sequence of positive numbers: the all 1's
sequence.
a(2,n) : A018892 Number of ways to write 1/n as a sum of exactly 2 unit
fractions.
a(3,n) : A004194 Number of partitions of 1/n into 3 reciprocals of
positive integers.
a(4,n) : A020327 Number of partitions of 1/n into 4 reciprocals of
positive integers.
a(5,n) : A020328 Number of partitions of 1/n into 5 reciprocals of
positive integers.
Alois
Leroy Quet schrieb:
> Could someone please calculate/submit the table {a(m,n)}, if it is
> worth submitting. I would submit a few (very few) terms myself, but I
> don't at all trust my "code" (pen and paper).
>
> Thanks,
> Leroy Quet
>
> [ ( [ ([( [ ( ([[o0Oo0Ooo0Oo(0)oO0ooO0oO0o]]) ) ] )]) ] ) ]
>
>
> --- On Wed, 5/5/10, franktaw at netscape.net <franktaw at netscape.net> wrote:
>
>> From: franktaw at netscape.net <franktaw at netscape.net>
>> Subject: [seqfan] Re: Egyptian Fractions
>> To: seqfan at list.seqfan.eu
>> Date: Wednesday, May 5, 2010, 10:06 AM
>> Probably not.
>>
>> The case n=1 is A002966.
>>
>> Franklin T. Adams-Watters
>>
More information about the SeqFan
mailing list