Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3.
A111246
Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =0a(7) =7a(8) =6a(9) =1a(10) =0a(11) =10a(12) =25a(13) =10a(14) =1a(15) =0a(16) =10a(17) =75a(18) =65a(19) =15a(20) =1a(21) =0a(22) =0a(23) =175a(24) =315a(25) =140a(26) =21a(27) =1a(28) =0a(29) =0
External references
- oeis: A111246