Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).
A056860
Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =1a(7) =3a(8) =6a(9) =5a(10) =1a(11) =4a(12) =12a(13) =20a(14) =15a(15) =1a(16) =5a(17) =20a(18) =50a(19) =75a(20) =52a(21) =1a(22) =6a(23) =30a(24) =100a(25) =225a(26) =312a(27) =203a(28) =1a(29) =7
External references
- oeis: A056860