196728

Appears in sequences

• Number of labeled n-node 4-valent graphs containing 3 double edges, a distinguished unordered pair of which are adjacent.at n=8A058833
• Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph with a perfect matching removed using exactly k interchangeable colors, for n >= 1 and 2 <= k <= 2n.at n=59A385437