Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068940
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068940 Maximal number of chess queens that can be placed on a 3-dimensional chess board of order n so that no two queens attack each other. +0
3
1, 1, 4, 7, 13, 21, 32, 48, 67, 91, 121, 133, 169 (list; graph; listen)
OFFSET

1,3

LINKS

Attacking Queens Programming Contest

Attacking Queens Programming Contest Results

Attacking Queens Programming Contest Database

CROSSREFS

Cf. A068941.

Sequence in context: A134781 A100848 A051458 this_sequence A008471 A111314 A139217

Adjacent sequences: A068937 A068938 A068939 this_sequence A068941 A068942 A068943

KEYWORD

nonn

AUTHOR

Al Zimmermann (AlZimmerma(AT)aol.com), Mar 08 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research