90005

Appears in sequences

• Number of 4-multigraphs on n nodes.at n=4A053420
• Table T(n,k) giving number of k-multigraphs on n nodes (n >= 1, k >= 0) read by antidiagonals.at n=40A063841
• Number of n-multigraphs on 5 nodes.at n=5A063843
• a(n) = 3600*n^2 + n.at n=4A157861
• Array read by descending antidiagonals: A(n,k) is the number of unoriented colorings of the edges of a regular n-dimensional simplex using up to k colors.at n=31A327084
• Array read by descending antidiagonals: T(n,k) is the number of unoriented colorings of the triangular faces of a regular n-dimensional simplex using k or fewer colors.at n=23A337884