login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068940 Maximal number of chess queens that can be placed on a 3-dimensional chessboard of order n so that no two queens attack each other. 3
1, 1, 4, 7, 13, 21, 32, 48, 67, 91, 121, 133, 169 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..13.

Attacking Queens Programming Contest, Description of the contest.

Al Zimmermann, Attacking Queens Programming Contest, Final report, 2002.

Attacking Queens Programming Contest Database [broken link]

CROSSREFS

Cf. A068941, A115992.

Sequence in context: A127977 A100848 A051458 * A147487 A190845 A190805

Adjacent sequences:  A068937 A068938 A068939 * A068941 A068942 A068943

KEYWORD

nonn

AUTHOR

Al Zimmermann, Mar 08 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 16:44 EST 2021. Contains 349430 sequences. (Running on oeis4.)