450560
domain: N
Appears in sequences
- Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).at n=18A058843
- Number of 4-colored labeled graphs with n nodes.at n=5A058874
- a(n) = (n-4)*(n-3)*2^(n-2).at n=14A181407
- Number of 3-cycles in the n-halved cube graph.at n=11A290026
- Numbers k such that the denominator of sigma(sigma(k))/k is equal to 2.at n=4A330598
- Number of subsets of {1..n} that contain exactly three odd numbers.at n=22A331408
- Heinz numbers of integer partitions whose product equals their length.at n=25A353699
- Fixed points of map n -> A366275(n).at n=31A366277