A075692 Upper irredundance number for queens graph Q_n on n^2 nodes.

1, 1, 2, 4, 5, 7, 9, 11, 13, 15

Offset

1,3

Links

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

Matthew D. Kearse and Peter B. Gibbons, Computational Methods and New Results for Chessboard Problems, Australasian Journal of Combinatorics 23 (2001), 253-284.

Matthew D. Kearse and Peter B. Gibbons, A new lower bound on upper irredundance in the queens' graph, Discrete Math., 256 (2002), 225-242.

Crossrefs

Cf. A075709.

Sequence in context: A005152 A060831 A073727 * A112235 A287175 A027921

Adjacent sequences: A075689 A075690 A075691 * A075693 A075694 A075695

Keyword

nonn,more

Author

Peter Gibbons (peter-g(AT)cs.auckland.ac.nz), Oct 13 2002

Status

approved