Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k*n.
A144510
Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k*n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =7a(8) =3a(9) =1a(10) =1a(11) =37a(12) =31a(13) =4a(14) =1a(15) =1a(16) =266a(17) =842a(18) =121a(19) =5a(20) =1a(21) =1a(22) =2431a(23) =45296a(24) =18252a(25) =456a(26) =6a(27) =1a(28) =1a(29) =27007
External references
- oeis: A144510