A075709 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A075709

Upper irredundance number for kings graph K_n on n^2 nodes.

1, 1, 4, 4, 9, 9, 16, 17, 25, 27, 36

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

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

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. A075692.

Sequence in context: A168039 A145445 A008794 * A332777 A238629 A192032

Adjacent sequences: A075706 A075707 A075708 * A075710 A075711 A075712

KEYWORD

nonn,more

AUTHOR

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

STATUS

approved