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 A115119 #9 Aug 28 2019 08:15:11
%S A115119 0,0,2,2,3,2,5,2,6,4,9,2,16,2,19,10,30,2,55,2,81,20,127,2,248,8,381,
%T A115119 46,690,2,1302,2,2250,128,4113,24,7896,2,14311,382,27036,2,51641,2,
%U A115119 96912,1266,184411,2,354918,18,675258,4114,1296861,2,2501365,132,4806102,14312
%N A115119 Number of imprimitive (periodic) n-bead necklaces with beads of 2 colors when turning over is allowed.
%C A115119 a(p)=2 for prime p.
%F A115119 a(n) = A000029(n) - A001371(n).
%t A115119 a29[n_] := a29[n] = (s = If[OddQ[n], 2^((n-1)/2), 2^(n/2-2) + 2^(n/2 - 1)]; a29[0] = 1; Do[s = s + EulerPhi[d] 2^(n/d)/(2n), {d, Divisors[n]}]; s);
%t A115119 a1371[n_] := Sum[MoebiusMu[d] a29[n/d], {d, Divisors[n]}]; a1371[0] = 1;
%t A115119 a[0] = 0; a[n_] := a29[n] - a1371[n];
%t A115119 Array[a, 70, 0] (* _Jean-François Alcover_, Aug 28 2019 *)
%Y A115119 Cf. A000029, A001371.
%K A115119 easy,nonn
%O A115119 0,3
%A A115119 _Valery A. Liskovets_, Jan 17 2006
%E A115119 More terms from _Jean-François Alcover_, Aug 28 2019