id:A092279 - OEIS Search Results

Search: id:A092279

Displaying 1-1 of 1 results found.

page 1

Floor(7*n/16) + 5.

+0
1

5, 5, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 13, 13, 14, 14, 15, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 19, 20, 20, 21, 21, 22, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 26, 27, 27, 28, 28, 29, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 33, 34, 34, 35, 35, 36, 36, 36, 37, 37 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Number of vertex guards needed to see both interior and exterior of simple orthogonal polygon with n nodes.`
	REFERENCES	`J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford Univ. Press, 1987, p. 157`
	CROSSREFS	`Sequence in context: A024729 A046271 A046263 this_sequence A127934 A087516 A135089` `Adjacent sequences: A092276 A092277 A092278 this_sequence A092280 A092281 A092282`
	KEYWORD	`nonn`
	AUTHOR	`njas, Feb 18 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research