A075692 - OEIS

This site is supported by donations to The OEIS Foundation.

A075692

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

1, 1, 2, 4, 5, 7, 9, 11, 13, 15 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	REFERENCES	`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 A027921 A047893` `Adjacent sequences: A075689 A075690 A075691 * A075693 A075694 A075695`
	KEYWORD	`nonn`
	AUTHOR	`Peter Gibbons (peter-g(AT)cs.auckland.ac.nz), Oct 13 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 08:44 EST 2012. Contains 205998 sequences.