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 #32 Mar 01 2018 05:36:19
%S 0,1,3,8,14,29,53,100,180,343,623,1172,2182,4105,7701,14590,27584,
%T 52475,99867,190732,364710,699237,1342169,2581412,4971052,9587563,
%U 18512775,35792550,69273650,134219777,260301157,505294108,981706812
%N The number of concave polygon classes.
%C A concave polygon has at least one concave interior corner angle, and at least three convex interior corner angles. Two concave polygon classes are equivalent if the cyclic ordering of the concave and convex interior angles of each are equal.
%C a(n) is also the number of combinatorial necklaces with n beads in 2 colors (black and white) with at least one white bead and no fewer than 3 black beads.
%H Jason Davies, <a href="https://www.jasondavies.com/necklaces/">Combinatorial necklaces and bracelets</a>
%H Peter Kagey, <a href="/A298612/a298612.pdf">Illustrations of a(4), a(5), a(6)</a>
%F a(n) = A000031(n) - A004526(n) - 3, n >= 3.
%F a(n) = A262232(n)-1, n >= 3.
%t Table[DivisorSum[n, EulerPhi[#] 2^(n/#) &]/n - Floor[n/2] - 3, {n, 3, 35}] (* _Michael De Vlieger_, Jan 28 2018 *)
%Y Cf. A000031, A004526, A227910, A262232.
%K nonn
%O 3,3
%A _Stuart E Anderson_, Jan 23 2018