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”).
%I #5 Feb 27 2020 07:05:06
%S 1,1,4,4,9,9,16,17,25,27,36
%N Upper irredundance number for kings graph K_n on n^2 nodes.
%H Matthew D. Kearse and Peter B. Gibbons, <a href="http://ajc.maths.uq.edu.au/pdf/23/ocr-ajc-v23-p253.pdf">Computational Methods and New Results for Chessboard Problems</a>, Australasian Journal of Combinatorics 23 (2001), 253-284.
%H Matthew D. Kearse and Peter B. Gibbons, <a href="https://doi.org/10.1016/S0012-365X(01)00467-8">A new lower bound on upper irredundance in the queens' graph</a>, Discrete Math., 256 (2002), 225-242.
%Y Cf. A075692.
%K nonn,more
%O 1,3
%A Peter Gibbons (peter-g(AT)cs.auckland.ac.nz), Oct 13 2002