**Triangle of partition numbers: T(n,k) = number of partitions of n in which the greatest part is k, 1<=k<=n. Also number of partitions of n into k positive parts (1 <= k <= n).**

*1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 1, 1, 1, 3, 4, 3, 2, 1, 1, 1, 4, 5, 5, 3, 2*

*4 seqfan posts*

Index of A-numbers in seqfan: by ascending order by month by frequency by keyword

Links to OEIS content are included according to The OEIS End-User License Agreement .