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 A045675 #14 Sep 23 2019 13:25:11 %S A045675 0,0,0,0,0,8,32,168,616,2380,8472,30760,109644,394816,1420784,5149948, %T A045675 18736744,68553728,251902032,929814984,3445433608,12814382620, %U A045675 47817551136,178982546512,671813695340,2528191984504,9536849826816 %N A045675 Number of 2n-bead balanced binary necklaces which are not equivalent to their reverse, complement or reversed complement. %C A045675 The number of 2n-bead balanced binary necklaces is A003239(n). The number which are equivalent to their reverse, complement and reversed complement are respectively A128014(n), A000013(n) and A011782(n). - _Andrew Howroyd_, Sep 28 2017 %H A045675 Jean-François Alcover, <a href="/A045675/b045675.txt">Table of n, a(n) for n = 0..100</a> %H A045675 <a href="/index/Ne#necklaces">Index entries for sequences related to necklaces</a> %F A045675 a(n) = A003239(n) - A128014(n) - A000013(n) - A011782(n) + 2*A045674(n). - _Andrew Howroyd_, Sep 28 2017 %t A045675 a3239[n_] := If[n==0, 1, Sum[EulerPhi[n/k]*Binomial[2k, k]/(2n), {k, Divisors[n]}]]; %t A045675 a128014[n_] := SeriesCoefficient[(1 + x)/Sqrt[1 - 4 x^2], {x, 0, n}]; %t A045675 a11782[n_] := SeriesCoefficient[(1 - x)/(1 - 2x), {x, 0, n}]; %t A045675 a13[n_] := If[n==0, 1, Sum[(EulerPhi[2d]*2^(n/d)), {d, Divisors[n]}]/(2n)]; %t A045675 a45674[n_] := a45674[n] = If[n==0, 1, If[EvenQ[n], 2^(n/2-1) + a45674[n/2], 2^((n-1)/2)]]; %t A045675 a[n_] := a3239[n] - a128014[n] - a13[n] - a11782[n] + 2 a45674[n]; %t A045675 a /@ Range[0, 100] (* _Jean-François Alcover_, Sep 23 2019 *) %Y A045675 Cf. A000013, A003239, A011782, A045674, A128014. %K A045675 nonn %O A045675 0,6 %A A045675 _David W. Wilson_