[seqfan] Re: Given any partition of n into k parts, what's the maximum permutations of parts

[Hans L]

Hi David,

The question is sort-of answered, but as I mentioned in my reply to
William: I am still wondering if it can be expressed in a simple(ish)
formula that doesn't require enumerating all partitions.
Or failing that, maybe just something that can run in free software such as
PARI.

I'm still quite new to OEIS, and haven't authored or co-authored anything
yet, I'm not sure what would be needed from me, but it would be nice to
have my name on something :)

As for the compression algorithm, its still a work in progress, and nothing
usable yet, but I think the concept should work well for such types of data
if I can get it working.

Thanks,
Hans

On Sun, Apr 7, 2019 at 5:14 PM David Corneth <davidacorneth at gmail.com>
wrote:

> Hi all,
>
> Has your question been answered Hans?
> I put a draft that describes your sequence as I understand it, A324209.
> Perhaps you could be co-author, Hans. If you like, I have a notepad file
> that lists examples for the partitions of the first few numbers and all
> sets that are maximum for their size and sum of elements. It's about 6.9 MB
> which could be big for OEIS and SeqFan. Perhaps I could show just one
> example and the number of partitions with that size and sum and number of
> permutations in a file on OEIS. Or perhaps your data compression algorithm
> could come in handy ;)
>
> Best,
> David
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>