Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113900
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113900 Number of partitions of 2n X 2n checkerboard into two congruent edgewise-connected sets, counting partitions equal under rotation or reflection only once. +0
1
1, 6, 255, 92263, 280864514 (list; graph; listen)
OFFSET

1,2

REFERENCES

Howard Eves, A Survey of Geometry, 1963, p265.

EXAMPLE

All partitions are radially symmetric, hence can be identified by

half the cut. The solution for 4 X 4 follows, with coordinates of

starting point and direction of each subsequent incremental cut

(North is positive Y).

(1,0)NNNES (1,0)NNE (1,0)NEN (1,0)NEENW (2,0)NN (2,0)NENW total = 6

CROSSREFS

Cf. A068392.

Sequence in context: A072228 A056238 A041853 this_sequence A053944 A015020 A003384

Adjacent sequences: A113897 A113898 A113899 this_sequence A113901 A113902 A113903

KEYWORD

nonn

AUTHOR

Joseph Sardinha (jsardi3(AT)juno.com), Jan 29 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research