53417

Appears in sequences

• Number of walks of length n between non-adjacent nodes on the Petersen graph.at n=12A091002
• Number of n X 2 0..1 arrays with rows, columns and antidiagonals unimodal and diagonals nondecreasing.at n=31A223764
• 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=44A385437