1 | initial version |
You can kill the computation, for Sage is apparently trying to build all of these sets in order to count them. This is the default behaviour (and not always a very good idea) when no .cardinality() method has been implemented specifically for this problem.
Here, the number of submultiset of [0..52] containing at most twice the same element is at least the number of subsets of 53, i.e. at least 2^53. That is already too much.
If you know how this value should be computed, however, you are welcome to add this missing feature into Sage !
http://www.sagemath.org/doc/developer/