login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003155 Number of ways to halve an n X n chessboard.
(Formerly M4111)
0
1, 1, 1, 6, 15, 255, 1897, 92263, 1972653, 281035054, 17635484470, 7490694495750, 1405083604458437, 1789509008288411290 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
This is the number of ways to cut an n X n chessboard along grid lines into two identical pieces. In the case that n is odd the central square is first removed to ensure an even number of squares. Solutions that differ only by rotation or reflection are considered equivalent. - Andrew Howroyd, Apr 19 2016
REFERENCES
M. Gardner, The Unexpected Hanging and Other Mathematical Diversions. Simon and Schuster, NY, 1969, p. 189.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
FORMULA
a(2n) = A113900(n). - Andrew Howroyd, Apr 19 2016
CROSSREFS
Sequence in context: A013230 A306342 A117062 * A335578 A199095 A235230
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
a(10) corrected and a(11)-a(14) from Andrew Howroyd, Apr 19 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 08:27 EDT 2024. Contains 371769 sequences. (Running on oeis4.)