From the somewhat arbitrary and dimensionful to the timeless classic, one man's subjective list of notable properties of specific numbers. [more inside]
posted by Talkie Toaster on Nov 8, 2012 - 39 comments

Ever wondered what comes next, and why? The On-Line Encyclopedia of Integer Sequences has the answers. (Previously.)
posted by parudox on Mar 10, 2009 - 33 comments

The Prime Game is not really much of a game, but it is a neat & little-known fact about the decimal representation of prime numbers.
posted by Wolfdog on Jul 10, 2007 - 24 comments

Can you stump the Encyclopedia of Integer Sequences? Every identifiable sequence known to man, including:

Name: Busy Beaver problem: maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.
Comment: The sequence grows faster than any computable function of n, and so is non-computable.
Keywords: hard,huge,nice,nonn,bref

If your sequence does not appear there, you might want to try the Super Seeker.
posted by vacapinta on Apr 15, 2002 - 9 comments