|
%I #11 Sep 08 2022 08:45:13
%S 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,
%T 16,17,17,18,18,19,19,19,20,20,21,21,22,22,22,23,23,24,24,25,25,26,26,
%U 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
%N a(n) = floor(7*n/16) + 5.
%C Number of vertex guards needed to see both interior and exterior of simple orthogonal polygon with n nodes.
%D J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford Univ. Press, 1987, p. 157
%H Vincenzo Librandi, <a href="/A092279/b092279.txt">Table of n, a(n) for n = 0..5000</a>
%F Empirical g.f.: -(4*x^16-x^14-x^12-x^10-x^7-x^5-x^3-5) / (x^17-x^16-x+1). - _Colin Barker_, Jul 30 2013
%t Table[Floor[7 n / 16] + 5, {n, 0, 80}] (* _Vincenzo Librandi_, Oct 04 2017 *)
%o (Magma) [Floor(7*n/16)+5: n in [0..80]]; // _Vincenzo Librandi_, Oct 04 2017
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Feb 18 2004
|
