On a partition function of Richard Stanly.
Andrews, George E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Andrews, George E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wagner, Carl G. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Chen, William Y.C., Li, Teresa X.S., Wang, David G.L. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, William Y.C., Wang, David G.L. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhao, Haijian, Zhong, Zheyuan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vella, David C. (2008)
Integers
Similarity:
Dohmen, Klaus, Tittmann, Peter (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Toufik Mansour, Mark Shattuck (2011)
Open Mathematics
Similarity:
Let L n, n ≥ 1, denote the sequence which counts the number of paths from the origin to the line x = n − 1 using (1, 1), (1, −1), and (1, 0) steps that never dip below the x-axis (called Motzkin left factors). The numbers L n count, among other things, certain restricted subsets of permutations and Catalan paths. In this paper, we provide new combinatorial interpretations for these numbers in terms of finite set partitions. In particular, we identify four classes of the partitions of...
Lam, Heung Yeung (2007)
Integers
Similarity:
Killpatrick, Kendra (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
David Gove (1993)
Acta Arithmetica
Similarity:
Can, Mahir Bilen, Sagan, Bruce E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: