A326371 - OEIS

A326371

Irregular triangular array: row n shows the number of condensations needed to convert all the partitions of n to strict partitions.

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

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

OFFSET

1,3

COMMENTS

It appears that there is a limiting row and that it includes every positive integer.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

EXAMPLE

First seven rows:

1 2

1 1 2

1 1 2 3 2