Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115992
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115992 Number of non-attacking queens that can be placed on a "hyper-chessboard" = hypercube of size 3, dimension n. That is, the size of the largest subset S of {0,1,2}^n such that for each pair (x0,y0,...), (x1,y1,...) of distinct elements of S, the absolute differences vector (|x1-x0|, |y1-y0|, ...) has at least two distinct non-null coordinates. +0
3
1, 1, 2, 4, 6, 11, 19, 32, 52 (list; graph; listen)
OFFSET

0,3

COMMENT

Sequence A115993 is an upper bound to this sequence. I do not know whether the two sequences differ.

LINKS

F. van der Plancke n-dimensional attacking queens (with source code and executable (q3_size3_102_simple) to compute the sequence)

EXAMPLE

a(3)>=4 because we can place 4 queens on a cubic chess board, as follows: S = {(0,0,0), (1,2,0), (0,1,2), (2,0,1)}. A further queen cannot be placed at (1,0,2), for instance, because that position is attacked by (2,0,1) (and also, incidentally, by (1,2,0) and (0,1,2), but not by (0,0,0)).

CROSSREFS

Cf. A115993 (upper bound, may be equal).

Adjacent sequences: A115989 A115990 A115991 this_sequence A115993 A115994 A115995

Sequence in context: A005684 A018167 A140443 this_sequence A115993 A136424 A116732

KEYWORD

hard,more,nonn

AUTHOR

Frederic van der Plancke (fplancke(AT)hotmail.com), Feb 10 2006, Feb 15 2008

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 October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research