This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A351360 #15 Mar 13 2022 19:31:47 %S A351360 0,0,1,2,3,5,9,17,31,60,113,220,419,813,1565,3033,5855,11358,21977, %T A351360 42644,82675,160517,311609,605551,1176871,2288964,4453237,8669002, %U A351360 16881859,32892459,64112225,125022545,243898335,476011102,929387453,1815322932 %N A351360 Number of binary necklaces with n beads and at least three consecutive black beads. %H A351360 Marko R. Riedel et al., <a href="https://math.stackexchange.com/questions/4376420/">Necklaces made of black and white beads</a>, Math StackExchange, Feb 2022. %F A351360 a(n) = A000031(n) - A093305(n). %Y A351360 Cf. A351356, A351357, A351358, A351359, A351361. %K A351360 nonn %O A351360 1,4 %A A351360 _Marko Riedel_, Feb 08 2022