[seqfan] Re: Counting permutations

[Alois Heinz]

There are 1-dimensional versions: A034137-A034150,
e.g.: A034136 Number of partitions of n into distinct parts from [ 1, 6 ],
but no references from a table, array or triangle.

So the 2-dimensional version seems to be not in OEIS until now.

Alois

Am 04.11.2011 18:52, schrieb Charles Greathouse:
> Orderless, no repeats allowed.  Just the sum of the number of
> partitions of n with greatest part exactly k for k = 1..m.
>
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
>
> On Fri, Nov 4, 2011 at 1:21 PM, wouter meeussen
> <wouter.meeussen at pandora.be>  wrote:
>> I agree that 2-dim arrays are hard to search.