Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Dec 10 2024 09:02:12
%S 1,2,2,4,5,10,11,21
%N The minimum number of diagonal lines required to cover all vertices created when the n outer vertices of a regular n-gon are connected by diagonal lines.
%C See A007569 for the total number of vertices created by the diagonal lines of a regular n-gon.
%C The terms a(9)..a(13) are less than or equal to 21, 25, 38, 41, 59 respectively.
%C Note that these numbers are not always the same as the minimum number of required lines if the lines can be arbitrarily placed. The first known occurrence where the numbers differ is for a(7) = 10 where one can use eight diagonal lines plus one off-diagonal line to cover two vertices in such a way that all vertices can be covered with only 9 lines.
%C Better upper bounds for a(10)..a(13) are 23, 36, 38, 56, with a(10), a(11) being almost certainly the correct values. _Scott R. Shannon_, Dec 10 2024
%H Scott R. Shannon, <a href="/A378831/a378831.png">Image showing one example of 11 diagonals covering all 57 vertices of the octagon</a>. The covering diagonals are shown as thicker white lines.
%Y Cf. A007569, A373813, A373811.
%K nonn,more,new
%O 2,2
%A _Scott R. Shannon_, Dec 08 2024
%E a(9) added by _Scott R. Shannon_, Dec 10 2024.