# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a368814
Showing 1-1 of 1

%I A368814 #6 Jan 06 2024 23:58:33
%S A368814 2,4,12,48,150,288,728,1344,1782,3780,5852,7224,12350,17108,16620,
%T A368814 30720,40018,46728,64676,80560,84462,121044,146280,163728,208250,
%U A368814 245700,271836,335664,389006,404400,514352,587264,638022,756228,853300,933480,1074998,1200724,1295112,1485120,1645002
%N A368814 Number of vertices in a regular 2n-gon when all vertices are connect by straight lines except for the n lines joining diametrically opposite vertices.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814.png">Image for n = 2</a>.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814_1.png">Image for n = 3</a>.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814_2.png">Image for n = 4</a>.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814_3.png">Image for n = 5</a>.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814_4.png">Image for n = 6</a>.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814_5.png">Image for n = 10</a>.
%H A368814 Scott R. Shannon, <a href="/A368814/a368814_6.png">Image for n = 15</a>. Note that the maximum number of chord crossings on a single vertex is six for this 30-gon, which is one less than the maximum theoretical value of seven for the regular n-gon with all diagonals drawn; see A007569.
%F A368814 a(n) = A368815(n) - A368813(n) + 1 by Euler's formula.
%Y A368814 Cf. A368813 (regions), A368815 (edges), A368816 (k-gons), A368756, A007569.
%K A368814 nonn
%O A368814 1,1
%A A368814 _Scott R. Shannon_, Jan 06 2024

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE