On Thu, 24 Jan 2008, Brian Granger wrote:
>
> Hi,
>
> This is a follow on to yesterdays thread about computing
> multiplicative partitions of integers...
>
> Question: where would we begin looking to see if this algorithm is
> known already?
Let a(m,n) be the number of multiplicative partitions of integers into m parts.
For m fixed, compute a(m,n) for n = 3,4,5... and search for this sequence in
Sloane's encyclopedia.
And, let b(n) = sum([a(m,n) for m = [1..n]]); also search for this sequence.
Often, even relatively recent research is known to Sloane's tables.
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
