Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Count the number of ways to partition a set where the order of the subsets matters
ResourceFunction["FubiniNumber"][set] counts the number of ways to partition set into subsets, where the order of the subsets matters. |
The simplest non-trivial Fubini number:
In[1]:= |
![]() |
Out[1]= |
![]() |
Here are the first 10 Fubini numbers:
In[2]:= |
![]() |
Out[2]= |
![]() |
This shows the 13 ordered set partitions of the the set {1,2,3}:
In[3]:= |
![]() |
Out[4]= |
![]() |
In[5]:= |
![]() |
Out[5]= |
![]() |
This accords with:
In[6]:= |
![]() |
Out[6]= |
![]() |
The Fubini numbers are periodic mod 10:
In[7]:= |
![]() |
Out[7]= |
![]() |
There are many other modular relations:
In[8]:= |
![]() |
Out[8]= |
![]() |
Wolfram Language 11.3 (March 2018) or above
This work is licensed under a Creative Commons Attribution 4.0 International License