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 A208591 #12 Nov 01 2017 12:24:56
%S A208591 1,3,7,23,77,297,1163,4783,20041,85735,371955,1634429,7254547,
%T A208591 32486709,146576693,665720447,3041096613,13963651875,64410421307,
%U A208591 298331882891,1386933722321,6469566027565,30271114380919,142037330038069,668187211909327
%N A208591 Number of n-bead necklaces labeled with numbers -2..2 not allowing reversal, with sum zero.
%H A208591 Andrew Howroyd, <a href="/A208591/b208591.txt">Table of n, a(n) for n = 1..100</a>
%F A208591 a(n) = (1/n) * Sum_{d | n} totient(n/d) * A005191(d). - _Andrew Howroyd_, Mar 02 2017
%e A208591 All solutions for n=3:
%e A208591 .-2...-1...-2...-2....0...-1...-1
%e A208591 ..2...-1....1....0....0....1....0
%e A208591 ..0....2....1....2....0....0....1
%t A208591 comps[r_, m_, k_] := Sum[(-1)^i*Binomial[r - 1 - i*m, k - 1]*Binomial[k, i], {i, 0, Floor[(r - k)/m]}]; a[n_Integer, k_] := DivisorSum[n, EulerPhi[n/#] comps[#*(k + 1), 2 k + 1, #] &]/n; a[n_] = a[n, 2]; Array[a, 25] (* _Jean-François Alcover_, Nov 01 2017, after _Andrew Howroyd_ *)
%Y A208591 Column 2 of A208597.
%K A208591 nonn
%O A208591 1,2
%A A208591 _R. H. Hardin_, Feb 29 2012
%E A208591 a(22)-a(25) from _Andrew Howroyd_, Mar 02 2017