Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165164
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165164 Smallest k such that no set of n lattice points gives visibility to every point of a square k x k lattice. +0
1
4, 6, 24, 133 (list; graph; listen)
OFFSET

1,1

COMMENT

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 this_sequence A136591 A009459 A123055

Adjacent sequences: A165161 A165162 A165163 this_sequence A165165 A165166 A165167

KEYWORD

hard,nonn

AUTHOR

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

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research