OFFSET
1,1
COMMENTS
For n>2 also number of asymmetric bracelets with n beads of five colors. - Herbert Kociemba, Nov 29 2016
LINKS
Robert Israel, Table of n, a(n) for n = 1..1434
C. G. Bower, Transforms (2)
F. Ruskey, Necklaces, Lyndon words, De Bruijn sequences, etc. [Cached copy, with permission, pdf format only]
FORMULA
"DHK" (bracelet, identity, unlabeled) transform of 5, 0, 0, 0...
From Herbert Kociemba, Nov 29 2016: (Start)
More generally, gf(k) is the g.f. for the number of asymmetric bracelets with n beads of k colors.
gf(k): Sum_{n>=1} mu(n)*( -log(1-k*x^n)/n - Sum_{i=0..2} binomial(k,i)x^(n*i)/(1-k*x^(2*n)) )/2. (End)
MAPLE
N:= 50: # for a(1)..a(N)
G:= add(1/2*numtheory:-mobius(n)*(-log(1-5*x^n)/n - add(binomial(5, i)*x^(n*i)/(1-5*x^(2*n)), i=0..2)), n=1..N):
S:= series(G, x, N+1):
5, 10, seq(coeff(S, x, j), j=3..N); # Robert Israel, Jun 24 2019
MATHEMATICA
m=5; (* asymmetric bracelets of n beads of m colors *) Table[Sum[MoebiusMu[d](m^(n/d)/n - If[OddQ[n/d], m^((n/d+1)/2), ((m+1)m^(n/(2d))/2)]), {d, Divisors[n]}]/2, {n, 3, 20}] (* Robert A. Russell, Mar 18 2013 *)
mx=40; gf[x_, k_]:=Sum[MoebiusMu[n]*(-Log[1-k*x^n]/n-Sum[Binomial[k, i]x^(n i), {i, 0, 2}]/(1-k x^(2n)))/2, {n, mx}]; ReplacePart[Rest[CoefficientList[Series[gf[x, 5], {x, 0, mx}], x]], {1->5, 2->10}] (* Herbert Kociemba, Nov 29 2016 *)
PROG
(PARI) a(n)={if(n<3, binomial(5, n), sumdiv(n, d, moebius(n/d)*(5^d/n - if(d%2, 5^((d+1)/2), 3*5^(d/2))))/2)} \\ Andrew Howroyd, Sep 12 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved