Geodesic
On Some Numbers Related to the Bell Numbers
Canadian mathematical bulletin, Tome 17 (1975) no. 5, pp. 733-738

Voir la notice de l'article provenant de la source Cambridge University Press

The Bell numbers Bn can be defined by Bn= where S(n, k) is t n e Stirling number of the second kind. In this note we employ a technique developed by Rota (which formalizes the umbral calculus) to derive a veriety of facts concerning the related numbers and polynomials . 
Tanny, Stephen M. On Some Numbers Related to the Bell Numbers. Canadian mathematical bulletin, Tome 17 (1975) no. 5, pp. 733-738. doi: 10.4153/CMB-1974-132-8
@article{10_4153_CMB_1974_132_8,
     author = {Tanny, Stephen M.},
     title = {On {Some} {Numbers} {Related} to the {Bell} {Numbers}},
     journal = {Canadian mathematical bulletin},
     pages = {733--738},
     year = {1975},
     volume = {17},
     number = {5},
     doi = {10.4153/CMB-1974-132-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-132-8/}
}
TY  - JOUR
AU  - Tanny, Stephen M.
TI  - On Some Numbers Related to the Bell Numbers
JO  - Canadian mathematical bulletin
PY  - 1975
SP  - 733
EP  - 738
VL  - 17
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-132-8/
DO  - 10.4153/CMB-1974-132-8
ID  - 10_4153_CMB_1974_132_8
ER  - 
%0 Journal Article
%A Tanny, Stephen M.
%T On Some Numbers Related to the Bell Numbers
%J Canadian mathematical bulletin
%D 1975
%P 733-738
%V 17
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-132-8/
%R 10.4153/CMB-1974-132-8
%F 10_4153_CMB_1974_132_8

[1] 1. Berge, C., Principles of Combinatorics, Academic Press, New York, 1971. Google Scholar

[2] 2. Carlitz, L., Eulerian numbers and polynomials, Math. Mag., Vol. 32 (1958–59), 247–260. Google Scholar

[3] 3. Comtet, L., Analyse Combinatoire, Tomes 1, 2, Presses Universitaires de France, 1970. Google Scholar

[4] 4. Dobinski, G., Grunert’s Archiv, 61 (1877), 333–336. Google Scholar

[5] 5. Feller, W., An Introduction to Probability Theory and its Applications, Vol. I, J. Wiley and Sons, New York, 1950. Google Scholar

[6] 6. Gross, O. A., Preferential arrangements, American Math. Monthly, Vol. 69, Jan. (1962), 4–8. Google Scholar

[7] 7. James, R. D., The factors of a square-free integer, Canadian Math. Bull. Google Scholar

[8] 8. Jordan, C., Calculus of Finite Differences, Second Ed., Chelsea Pub. Co., New York, 1960. Google Scholar

[9] 9. Mullin, R. and Rota, G.-C., On the foundations of combinatorial theory. III. Theory of binominal enumeration, Graph Theory and its Applications (1970), 167–213. Google Scholar

[10] 10. Riordan, J., An Introduction to Combinatorial Theory, J. Wiley and Sons, New York, 1958. Google Scholar

[11] 11. Riordan, J., Generating functions, in Applied Combinatorial Mathematics, ed. Edwin F. Beckenback, John Wiley and Sons, New York, (1964), 67–95. Google Scholar

[12] 12. Riordan, J., Combinatorial Identities, John Wiley and Sons, New York, 1968. Google Scholar

[13] 13. Rota, G.-C., The number of partitions of a set, American Math. Monthly, Vol. 71, No. 5, May, 1964. Google Scholar

[14] 14. Tanny, S. M., A probabilistic interpretation of Eulerian numbers, Duke Math. J., Vol. 40, No. 4 (1973), 717–722. Google Scholar

[15] 15. Worpitzky, J., Studien iiber die Bernoullischen und Eulerschen Zahlen, Journal fur die reine and angewandte Mathematik, Vol. 94 (1883), pp. 203–232. Google Scholar

Cité par Sources :