login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075692 Upper irredundance number for queens graph Q_n on n^2 nodes. 3
1, 1, 2, 4, 5, 7, 9, 11, 13, 15 (list; graph; refs; listen; history; text; 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.

LINKS

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

CROSSREFS

Cf. A075709.

Sequence in context: A005152 A060831 A073727 * A112235 A287175 A027921

Adjacent sequences:  A075689 A075690 A075691 * A075693 A075694 A075695

KEYWORD

nonn

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 20:24 EDT 2019. Contains 325056 sequences. (Running on oeis4.)