Irregular triangle T(n,k), n>=1, 1<=k<=ceiling(n/2), read by rows: T(n,k) is the number of different ways to select k disjoint (nonempty) subsets from {1..n} with equal element sum.
A196231
Irregular triangle T(n,k), n>=1, 1<=k<=ceiling(n/2), read by rows: T(n,k) is the number of different ways to select k disjoint (nonempty) subsets from {1..n} with equal element sum.
Terms
- a(0) =1a(1) =3a(2) =7a(3) =1a(4) =15a(5) =3a(6) =31a(7) =7a(8) =1a(9) =63a(10) =17a(11) =3a(12) =127a(13) =43a(14) =8a(15) =1a(16) =255a(17) =108a(18) =22a(19) =3a(20) =511a(21) =273a(22) =63a(23) =9a(24) =1a(25) =1023a(26) =708a(27) =157a(28) =23a(29) =3
External references
- oeis: A196231