|
Search: id:A075709
|
|
|
| A075709 |
|
Upper irredundance number for kings graph K_n on n^2 nodes. |
|
+0
2
|
|
| 1, 1, 4, 4, 9, 9, 16, 17, 25, 27, 36
(list; graph; listen)
|
|
|
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: A065730 A145445 A008794 this_sequence A116682 A088190 A092322
Adjacent sequences: A075706 A075707 A075708 this_sequence A075710 A075711 A075712
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Peter Gibbons (peter-g(AT)cs.auckland.ac.nz), Oct 13 2002
|
|
|
Search completed in 0.002 seconds
|
