You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to sage-support
Hi all,
please consider this counting of special combinations:
def C(n, k): return Compositions(n, max_part=k, inner=[k]).cardinality() for n in (0..4): print([C(n, k) for k in (0..n)])
[0] [0, 1] [0, 1, 1] [0, 1, 1, 1] [0, 1, 2, 1, 1]
Edge cases are notoriously difficult and error-prone. Maybe a combinatorialist can help me: I suspect the case C(0, 0) to be wrong, it shouldn't be C(0,0) = 0, but C(0,0) = 1.