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
Sat Aug 20 21:39:02 CEST 2011 [seqfan] Re: Partition numbers
Sat Aug 20 20:45:04 CEST 2011 [seqfan] Re: Partition numbers
Sun Nov 15 00:54:48 CET 2009 [seqfan] Formula for A124577 ?
Fri Sep 25 20:40:38 CEST 2009 [seqfan] Re: Number of ways to write n^2 as the sum of n odd numbers
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
.