[seqfan] Re: Egyptian Fractions

[Leroy Quet]

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
> 
> -----Original Message-----
> From: Leroy Quet <q1qq2qqq3qqqq at yahoo.com>
> 
> Let a(m,n) be the number of sums of exactly m reciprocals
> that equal 
> 1/n.
> 
> ie. a(m,n) =
> Number of multisets {k(1),k(2),..., k(m)} where
> 1/n = sum{j=1 to m} 1/k(j),
> 
> where all k's are positive integers.
> 
> Is the array {a(m,n)} in the OEIS?
> 
> 
> _______________________________________________
> 
> Seqfan Mailing list - http://list.seqfan.eu/
>