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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165164 Smallest k such that no set of n lattice points gives visibility to every point of a square k x k lattice. 0
4, 6, 24, 133 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

At least n+1 lattice points must be selected as viewpoints in order to give visibility to all lattice points of a square a(n) x a(n) lattice.

EXAMPLE

For k<24, given a k x k square lattice, there is at least one way to select a set of 3 or fewer lattice points as viewpoints that, collectively, give visibility to all k^2 lattice points; at k=24, however, no such set of 3 points exists, so a(3)=24.

CROSSREFS

Equals minimum k such that A157639(k) > n.

Sequence in context: A057343 A000287 A032087 * A136591 A009459 A123055

Adjacent sequences:  A165161 A165162 A165163 * A165165 A165166 A165167

KEYWORD

hard,nonn

AUTHOR

Jon E. Schoenfield (jonscho(AT)hiwaay.net), Sep 06 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.