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 A337827 #44 Sep 30 2020 05:01:20
%S A337827 1,4,91,5106,510312,79419180,17758541160,5397245416080,
%T A337827 2140495978440960,1073686615987184640,664582969579048732800,
%U A337827 497566995304189676342400,443212653988584642449548800,463237380681508395323231270400,561422444732790213860755013145600,780983354978825959061219179885824000
%N A337827 a(n) is the number of 2n-bead necklaces with exactly n different colored beads.
%H A337827 Wikipedia, <a href="https://en.wikipedia.org/wiki/Necklace_(combinatorics)">Necklace combinatorics</a>
%F A337827 a(n) = A087854(2*n,n) = (n!/(2*n)) * Sum_{d|2*n} phi(d) * S2(2*n/d, n) where S2(n,k) are the Stirling numbers of the second kind.
%F A337827 a(n) = (n!/(2*n))*(S2(2*n, n)+1) since S2(n, n) = 1 and S2(2*n/d, n) = 0 if d>2.
%e A337827 a(2) = 4, corresponding to the necklaces WBBB, WBWB, WWBB, and WWWB.
%t A337827 Table[n! * (StirlingS2[2*n, n] + 1) / (2*n), {n, 1, 16}] (* _Amiram Eldar_, Sep 25 2020 *)
%o A337827 (PARI) T(n,k) = (k!/n) * sumdiv(n,d, eulerphi(d) * stirling(n/d, k,2)); \\ A087854
%o A337827 vector(22,n,T(2*n,n)) \\ _Joerg Arndt_, Sep 25 2020
%Y A337827 Cf. A087854, A007820.
%K A337827 nonn
%O A337827 1,2
%A A337827 _Yves-Loic Martin_, Sep 24 2020
%E A337827 Terms a(6) and beyond from _Joerg Arndt_, Sep 25 2020