67685

Appears in sequences

• Number of colorings of the edges of the complete graph on n unlabeled vertices using at most four colors up to permutation of the colors.at n=4A233748
• Numbers k such that A003132(k^3) = A003132(k), where A003132(n) is the sum of the squares of the digits of n.at n=18A309884