A075709 - OEIS

This site is supported by donations to The OEIS Foundation.

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; 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. A075692.` `Sequence in context: A168039 A145445 A008794 * A192032 A116682 A168157` `Adjacent sequences: A075706 A075707 A075708 * A075710 A075711 A075712`
	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 21:13 EST 2012. Contains 206085 sequences.