A309746 Number of ways of placing 2*n-1 nonattacking queens on a hexagonal board with edge-length n in Glinski's hexagonal chess.

1, 0, 0, 2, 0, 0, 0, 6, 0, 36, 0, 72, 332, 1596, 6972

Offset

1,4

Comments

Conjecture: for n >= 12 is a(n) > 0. Proved for n <= 20. - Vaclav Kotesovec, Sep 06 2019

Links

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

Chess variants, Glinski's Hexagonal Chess

Vaclav Kotesovec, Examples for n = 4, 8, 10, 12, 13 and 14

Vaclav Kotesovec, Examples for n = 15, 16, 17, 18, 19 and 20

Wikipedia, Hexagonal chess - Gliński's hexagonal chess

Crossrefs

Cf. A002047, A003215, A309260, A309669.

Sequence in context: A326390 A053203 A158360 * A094315 A212148 A364988

Adjacent sequences: A309743 A309744 A309745 * A309747 A309748 A309749

Keyword

nonn,more

Author

Vaclav Kotesovec, Aug 15 2019

Extensions

a(15) from Vaclav Kotesovec, Aug 28 2019

Status

approved