|
|
A257952
|
|
Number of ways to quarter a 2n X 2n chessboard.
|
|
9
|
|
|
1, 1, 5, 37, 766, 43318, 7695805, 4015896016, 6371333036059, 30153126159555641, 431453249608567040694, 18558756256964594960321428, 2411839397220672351872242339314, 945878376319424018440202856702995909, 1121914029089423867715407724741780046405923
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Number of ways to dissect a 2n X 2n chessboard into 4 congruent pieces. As stated by Thomas R. Parkin in his letter (see Links), the dissections belong to two classes. One in which the cuts divide the chessboard into four pieces which are 90-degree rotationally symmetric, the other in which the square is first bisected in two rectangles and then each rectangle is divided into two pieces which are 180-degree rotationally symmetric.
Two dissections are considered distinct if they belong to two different classes, even if the tile is the same. In both classes reflections and rotations are not counted, and moreover in the second class two dissections are considered the same if they differ only by the orientation of the tiles.
|
|
REFERENCES
|
M. Gardner, The Unexpected Hanging and Other Mathematical Diversions. Simon and Schuster, NY, 1969, p. 189.
Popular Computing (Calabasas, CA), Vol. 1 (No. 7, 1973), Problem 15, front cover and page 2.
|
|
LINKS
|
T. R. Parkin, Discussion of Problem 15, Popular Computing (Calabasas, CA), Vol. 2, Number 15 (June 1974), pages PC15-4 to PC15-8.
|
|
FORMULA
|
|
|
MATHEMATICA
|
A006067 = Import["https://oeis.org/A006067/b006067.txt", "Table"][[All, 2]];
a[n_] := If[n == 0, 1, A006067[[2n]]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|