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 A115122 #6 Aug 28 2019 08:16:05
%S A115122 0,0,1,1,2,1,4,1,7,3,16,1,49,1,129,17,415,1,1408,1,4659,130,16081,1,
%T A115122 56858,15,200171,1367,716733,1,2590529,1,9393119,16082,34319668,142,
%U A115122 126104312,1,465076161,200172,1723097474,1,6408573532,1,23910271229,2587214,89493903439
%N A115122 Number of imprimitive (periodic) 2n-bead black-white complementable necklaces with n black beads.
%C A115122 a(p)=1 for prime p.
%F A115122 a(n)=A045629(n) - A045632(n).
%t A115122 A045629[n_] := If[n==0, 1, (1/(2n)) DivisorSum[n, EulerPhi[n/#] Binomial[ 2 # - 1, # - 1] + EulerPhi[2 (n/#)] 2^(# - 1)&]];
%t A115122 A045632[n_] := If[n==0, 1, Sum[MoebiusMu[n/d] A045629[d], {d, Divisors[n]}]];
%t A115122 a[n_] := A045629[n] - A045632[n];
%t A115122 Table[a[n], {n, 0, 60}] (* _Jean-François Alcover_, Aug 28 2019 *)
%K A115122 easy,nonn
%O A115122 0,5
%A A115122 _Valery A. Liskovets_, Jan 17 2006
%E A115122 More terms from _Jean-François Alcover_, Aug 28 2019