184 (number)

There are 184 different Eulerian graphs on eight unlabeled vertices,^[1] 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.^[2] 184 is also a refactorable number.

In other fields

Some physicists have proposed that 184 is a magic number for neutrons in atomic nuclei.^[3]^[4]

References

[1]
Sloane, N. J. A. (ed.). "Sequence A003049 (Number of connected Eulerian graphs with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
[2]
Sloane, N. J. A. (ed.). "Sequence A007764 (Number of nonintersecting (or self-avoiding) rook paths joining opposite corners of an n X n grid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
[3]
Sobiczewski, A.; Gareev, F.A.; Kalinkin, B.N. (September 1966). "Closed shells for $Z>82$ and $N>126$ in a diffuse potential well". Physics Letters. 22 (4): 500â502. doi:10.1016/0031-9163(66)91243-1.
[4]
Cho, Adrian (February 2004). "New chemical elements probe the shoals of stability". Science. 303 (5659): 740. doi:10.1126/science.303.5659.740a. PMID 14764834. S2CID 37186047.

Wikimedia Commons has media related to 184 (number).

This article about a number is a stub. You can help Wikipedia by adding missing information.

In mathematics

In other fields

See also

References

Related Articles