NextTableau[t] gives the tableau of shape t, following t in lexicographic order.
NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.
NormalDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.
NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.
NumberOfCompositions[n, k] counts the number of distinct compositions of integer n into k parts.
NumberOfDerangements[n] counts the derangements on n elements, that is, the permutations without any fixed points.
NumberOfInvolutions[n] counts the number of involutions on n elements.
NumberOfPartitions[n] counts the number of integer partitions of n.
NumberOfPermutationsByCycles[n, m] gives the number of permutations of length n with exactly m cycles.
NumberOfPermutationsByTypes[l] gives the number of permutations of type l.