Skip to main content

All Questions

5 votes
3 answers
158 views

The number of partitions of $\{1, \ldots, n+1\}$ into subsets of nonconsecutive integers

For each integer $n$, let $a_n$ be the number of partitions of $\{1, \ldots, n+1\}$ into subsets of nonconsecutive integers. I found (by listing) that $ a_1, a_2, a_3, a_4$ are $1, 2, 5, 15$ ...
Math_fun2006's user avatar
2 votes
0 answers
24 views

Bell numbers - Cardinality of odd number of parts in partitions of the finite set $[n]$.

As it well known, Bell numbers denoted $B_{n}$ counts distinct partitions of the finite set $[n]$. So for example if $n=3$ there are 5 ways to the set $\left\{ a,b,c\right\}$ can be partitioned: $$\...
linuxbeginner's user avatar
1 vote
1 answer
235 views

Number of unordered factorizations of a non-square-free positive integer

I recently discovered that the number of multiplicative partitions of some integer $n$ with $i$ prime factors is given by the Bell number $B_i$, provided that $n$ is a square-free integer. So, is ...
Scene's user avatar
  • 1,611
7 votes
2 answers
6k views

Partitions and Bell numbers

Let $F(n)$ be the number of all partitions of $[n]$ with no singleton blocks. Find the recursive formula for the numbers $F(n)$ in terms of the numbers $F(i)$, with $i ≤ n − 1$ Find a formula for $F(...
tijme's user avatar
  • 131