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 A351363 #13 Mar 13 2022 19:32:17 %S A351363 0,0,0,1,5,21,84,327,1251,4760,18018,68104,257088,970480,3664070, %T A351363 13842215,52331695,198021936,750027090,2843686271,10792866315, %U A351363 41006110365,155961264880,593797895358,2263126224780,8634161689920,32973466762098,126047166461574,482298648250416,1847156083546316 %N A351363 Number of necklaces with n black and n white beads with at least four consecutive black beads. %H A351363 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 A351363 a(n) = A003239(n) - A351364(n). %Y A351363 Cf. A351359, A351357, A351358, A351359, A351360, A351361. %K A351363 nonn %O A351363 1,5 %A A351363 _Marko Riedel_, Feb 08 2022