# The ordered Bell numbers as weighted sums of odd or even Stirling numbers of the second kind

@inproceedings{Sprittulla2021TheOB, title={The ordered Bell numbers as weighted sums of odd or even Stirling numbers of the second kind}, author={Jacob Sprittulla}, year={2021} }

For the Stirling numbers of the second kind S(n, k) and the ordered Bell numbers B(n), we prove the identity n/2 k=1 S(n, 2k)(2k − 1)! = B(n − 1). An analogous identity holds for the sum over odd k’s.

#### References

SHOWING 1-6 OF 6 REFERENCES

The Worpitzky Numbers Revisited

- Computer Science, Mathematics
- Am. Math. Mon.
- 2018

This work relates how the Worpitzky number triangle emerges in the setting of a novel counting problem that involves placing up- and right-arrows in a rectangular grid in a polite manner and concludes with a short proof of the Von Staudt–Clausen theorem. Expand

The On-Line Encyclopedia of Integer Sequences

- Mathematics, Computer Science
- Electron. J. Comb.
- 1994

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used. Expand

Combinatorial Identities for Stirling Numbers

- World Scientific
- 2016

Generatingfunctionology

- Academic Press
- 1990

Mathematics Subject Classification: Primary 11A51; Secondary 05A17. Keywords: ordered Bell number, Stirling number of the second kind