Did I find the right examples for you? yes no

sympy.combinatorics.RGS_enum

All Samples(2)  |  Call(1)  |  Derive(0)  |  Import(1)
```RGS_enum computes the total number of restricted growth strings
possible for a superset of size m.

Examples
========

>>> from sympy.combinatorics.partitions import RGS_enum
>>> from sympy.combinatorics.partitions import Partition
>>> RGS_enum(4)
15(more...)
```

```        def RGS_enum(m):
"""
RGS_enum computes the total number of restricted growth strings
possible for a superset of size m.

Examples
========

>>> from sympy.combinatorics.partitions import RGS_enum
>>> from sympy.combinatorics.partitions import Partition
>>> RGS_enum(4)
15
>>> RGS_enum(5)
52
>>> RGS_enum(6)
203

We can check that the enumeration is correct by actually generating
the partitions. Here, the 15 partitions of 4 items are generated:

>>> a = Partition([list(range(4))])
>>> s = set()
>>> for i in range(20):
...     a += 1
...
>>> assert len(s) == 15

"""
if (m < 1):
return 0
elif (m == 1):
return 1
else:
return bell(m)
```

```    symbols, Integral, Tuple, Dummy, Basic, default_sort_key, Matrix,
factorial)
from sympy.combinatorics import RGS_enum, RGS_unrank, Permutation
from sympy.utilities.iterables import (
_partition, _set_partitions, binary_partitions, bracelets, capture,
```
```            assert  q == RGS_unrank(i, n)
i = i+1
assert i == RGS_enum(n)

def test_binary_partitions():
```