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 A276547 #12 Jun 16 2017 03:01:15
%S A276547 1,1,2,5,11,39,126,537,2358,11690,61689,351725,2126496,13639244,
%T A276547 92197509,655035225,4874404107,37893368072,306986431846,2586209738004,
%U A276547 22612848403442,204850732418594,1919652428481929,18581619724011091,185543613289200937,1908894098864372104
%N A276547 Number of primitive (period n) n-bead necklace structures using an infinite alphabet.
%H A276547 Andrew Howroyd, <a href="/A276547/b276547.txt">Table of n, a(n) for n = 1..200</a>
%F A276547 a(n) = Sum_{d|n} mu(n/d) * A084423(d).
%t A276547 u[0, _] = 1; u[k_, j_] := u[k, j] = Sum[Binomial[k - 1, i - 1]*DivisorSum[j, u[k - i, j]*#^(i - 1)&], {i, 1, k}];
%t A276547 b[0] = 1; b[n_] := DivisorSum[n, EulerPhi[#]*u[n/#, #]&]/n;
%t A276547 a[1] = 1; a[n_] := DivisorSum[n, MoebiusMu[n/#]*b[#]&];
%t A276547 Array[a, 26] (* _Jean-François Alcover_, Jun 16 2017, using Franklin T. Adams-Watters' code for A084423 *)
%Y A276547 Row sums of A107424.
%Y A276547 Cf. A084423.
%K A276547 nonn
%O A276547 1,3
%A A276547 _Andrew Howroyd_, Apr 09 2017