Triangle read by rows in which row n gives number of ways to partition n labeled elements into k pie slices allowing the pie to be turned over (n >= 1, 1 <= k <= n).
A133800
Triangle read by rows in which row n gives number of ways to partition n labeled elements into k pie slices allowing the pie to be turned over (n >= 1, 1 <= k <= n).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =1a(7) =7a(8) =6a(9) =3a(10) =1a(11) =15a(12) =25a(13) =30a(14) =12a(15) =1a(16) =31a(17) =90a(18) =195a(19) =180a(20) =60a(21) =1a(22) =63a(23) =301a(24) =1050a(25) =1680a(26) =1260a(27) =360a(28) =1a(29) =127
External references
- oeis: A133800