2000 character limit reached
The deranged Bell numbers
Published 30 Jan 2021 in math.GM | (2102.00139v1)
Abstract: It is known that the ordered Bell numbers count all the ordered partitions of the set $[n]={1,2,\dots,n}$. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of $[n]$. We first study the classical properties of these numbers (generating function, explicit formula, convolutions, etc.), we then present an asymptotic behavior of the deranged Bell numbers. Finally, we give some brief results for their $r$-versions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.