Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075692 Upper irredundance number for queens graph Q_n on n^2 nodes. +0
2
1, 1, 2, 4, 5, 7, 9, 11, 13, 15 (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. A075709.

Adjacent sequences: A075689 A075690 A075691 this_sequence A075693 A075694 A075695

Sequence in context: A005152 A060831 A073727 this_sequence A112235 A027921 A047893

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research