-color partition theoretic interpretations of some mock theta functions.
-color partitions with weighted differences equal to minus two.
-words over any alphabet with forbidden any 3-subwords.
-words over any alphabet without subword for fixed , and .
New bounds on the number of representation of as a binomial coefficient.
New directions in enumerative chess problems.
New Euler-Mahonian permutation statistics.
New lower bound on the number of ternary square-free words.
Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle).
Nombres de Bell et analyse -adique
Nonhomogeneous parking functions and noncrossing partitions.
Nonintersecting lattice paths on the cylinder.
Nonisomorphic Steiner Triple System.
Note on enumeration of labeled split graphs
The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.
Note on Legendre numbers.
Note on the number of monoids of order
Number of alternatives in reducing finite spaces and vector spaces
Number of “”s of a Dyck path and -nilpotent ideals of parabolic subalgebras of .