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.
A008284
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =1a(9) =1a(10) =1a(11) =2a(12) =2a(13) =1a(14) =1a(15) =1a(16) =3a(17) =3a(18) =2a(19) =1a(20) =1a(21) =1a(22) =3a(23) =4a(24) =3a(25) =2a(26) =1a(27) =1a(28) =1a(29) =4
External references
- oeis: A008284