A373244 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A373244

T(n,k) = number of integer partitions of n into k parts for which the number of distinct parts is equal to the number of distinct multiplicities.

1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 3, 2, 2, 1, 1, 1, 1, 3, 2, 2, 2, 1, 1, 1, 0, 4, 2, 3, 1, 2, 1, 1, 1, 1, 4, 3, 2, 4, 2, 2, 1, 1, 1, 0, 5, 3, 4, 5, 4, 2, 2, 1, 1, 1, 1, 5, 3, 3, 5, 4, 3, 2, 2, 1, 1, 1, 0, 6, 4, 5, 8, 6, 5, 4, 2, 2, 1, 1, 1, 1, 6, 4, 5, 10, 6, 7, 5, 4, 2, 2, 1, 1

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,13

COMMENTS

Row sum is A098859 (Wilf partitions of n).

Counts the zeros in A373241 or A373242.

REFERENCES

See references listed in A098859.

LINKS

Alois P. Heinz, Rows n = 1..200, flattened (first 40 rows from Olivier Gérard)

EXAMPLE

Array begins:

1, 1,

1, 0, 1,

1, 1, 1, 1,

1, 0, 2, 1, 1,

1, 1, 2, 1, 1, 1,

1, 0, 3, 2, 2, 1, 1,

1, 1, 3, 2, 2, 2, 1, 1,

1, 0, 4, 2, 3, 1, 2, 1, 1

...

MATHEMATICA

Flatten[Table[

Plus @@@

Table[Count[

Map[Length[Union[#]] == Length[Union[Length /@ Split[#]]] &,

IntegerPartitions[n, {k}]], True], {k, 1, n}], {n, 1, 20}]]

CROSSREFS

Sequence in context: A335106 A093518 A128184 * A025450 A139128 A106752

Adjacent sequences: A373241 A373242 A373243 * A373245 A373246 A373247

KEYWORD

nonn,tabl

AUTHOR

Olivier Gérard, May 29 2024

STATUS

approved