184

There are 184 different Eulerian graphs on eight unlabeled vertices, and 184 paths by which a chess rook can travel from one corner of a 4 × 4 chessboard to the opposite corner without passing through the same square twice. 184 is also a refactorable number.