Combinatorial proofs of some Stirling number formulas

[1] L. Carlitz, q-Bernoulli numbers and polynomials, Duke Math. J., 15 (1948) 987-1000.Search in Google Scholar

[2] L. Carlitz, Generalized Stirling numbers, Combinatorial Analysis Notes, Duke University, (1968) 8-15.Search in Google Scholar

[3] W. Chu and C. Wei, Set partitions with restrictions, Discrete Math., 308 (2008) 3163-3168.Search in Google Scholar

[4] H. W. Gould and J. Quaintance, Implications of Spivey's Bell number formula, J. Integer Seq., 11 (2008) Art. 08.3.7.Search in Google Scholar

[5] T. Mansour, Combinatorics of Set Partitions, Chapman & Hall/CRC, Boca Raton, Florida, 2012.10.1201/b12691Search in Google Scholar

[6] T. Mansour and A. O. Munagi, Set partitions with circular successions, European J. Com- bin., 42 (2014) 207-216.Search in Google Scholar

[7] A. O. Munagi, Extended set partitions with successions, European J. Combin., 29 (2008) 1298-1308.Search in Google Scholar

[8] M. Shattuck, Recounting relations for set partitions with restrictions, Ars Combin., 91 (2009) 267-270.Search in Google Scholar

[9] M. A. Shattuck and C. G. Wagner, Parity theorems for statistics on domino arrangements, Electron. J. Combin., 12 (2005) #N10.10.37236/1977Search in Google Scholar

[10] N. J. Sloane, The On-Line Encyclopedia of Integer Sequences, http://oeis.org/.Search in Google Scholar

[11] M. Z. Spivey, A generalized recurrence for Bell numbers, J. Integer Seq., 11 (2008) Art. 08.2.5.Search in Google Scholar

[12] C. G. Wagner, Partition statistics and q-Bell numbers (q = -1), J. Integer Seq., 7 (2004) Art. 04.1.1. Search in Google Scholar