Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068393
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
2, 3, 7, 44, 494 (list; graph; listen)
OFFSET

2,1

CROSSREFS

Sequence in context: A082993 A071580 A014546 this_sequence A032053 A086542 A058181

Adjacent sequences: A068390 A068391 A068392 this_sequence A068394 A068395 A068396

KEYWORD

nonn

AUTHOR

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

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research