4545100

Appears in sequences

• a(n) = binomial(A000460(n), 3).at n=2A176018
• The number of inequivalent ways to color the vertices of a regular octahedron using at most n colors.at n=23A198833