login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068393 Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets. Partitions equal under rotation or reflection are counted only once. 0
2, 3, 7, 44, 494 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

CROSSREFS

Sequence in context: A082993 A071580 A014546 * A032053 A086542 A058181

Adjacent sequences:  A068390 A068391 A068392 * A068394 A068395 A068396

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net), Mar 03 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:14 EST 2012. Contains 206031 sequences.