combinat
bell
compute Bell numbers
Calling Sequence
Parameters
Description
Examples
bell(n)
n
-
expression
The procedure bell computes the nth Bell number if the argument n is an integer; otherwise, it returns the unevaluated function call. For the BellB polynomials see BellB.
The Bell numbers are defined by the exponential generating function:
ⅇⅇx−1=∑n=0∞⁡bell⁡n⁢xnn!
The Bell numbers are computed using the umbral definition :
bell⁡n+1=bell⁡+1n
where bell()^n represents bell(n).
For example:
bell⁡3=bell⁡2+2⁢bell⁡1+1
bell4=bell3+3 bell2+3 bell1+1
belln+1=∑i=0nni⁢belli
if 0<n
The nth Bell number has several interesting interpretations, including
the number of rhyming schemes in a stanza of n lines
the number of ways n unlike objects can be placed in n like boxes
the number of ways a product of n distinct primes may be factored
The command with(combinat,bell) allows the use of the abbreviated form of this command.
with⁡combinat,bell
bell⁡1
1
bell⁡4
15
bell⁡−1
bell⁡n
See Also
BellB
binomial
Download Help Document