

A092279


a(n) = floor(7*n/16) + 5.


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;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

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


LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..5000


FORMULA

Empirical g.f.: (4*x^16x^14x^12x^10x^7x^5x^35) / (x^17x^16x+1).  Colin Barker, Jul 30 2013


MATHEMATICA

Table[Floor[7 n / 16] + 5, {n, 0, 80}] (* Vincenzo Librandi, Oct 04 2017 *)


PROG

(MAGMA) [Floor(7*n/16)+5: n in [0..80]]; // Vincenzo Librandi, Oct 04 2017


CROSSREFS

Sequence in context: A046271 A283076 A046263 * A159002 A127934 A205236
Adjacent sequences: A092276 A092277 A092278 * A092280 A092281 A092282


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, Feb 18 2004


STATUS

approved



