|
%I M0696 N0257 #44 Apr 15 2024 07:49:37
%S 1,1,1,1,2,3,5,8,14,21,39,62,112,189,352,607,1144,2055,3885,7154,
%T 13602,25472,48670,92204,176770,337590,649341,1246840,2404872,4636389,
%U 8964143,17334800,33587072,65107998,126387975,245492232,477349348
%N Number of primitive n-bead necklaces (turning over is allowed) where complements are equivalent.
%C Also, number of "twills" (Grünbaum and Shephard). - _N. J. A. Sloane_, Oct 21 2015
%D B. Grünbaum and G. C. Shephard, The geometry of fabrics, pp. 77-98 of F. C. Holroyd and R. J. Wilson, editors, Geometrical Combinatorics. Pitman, Boston, 1984.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Christian G. Bower, <a href="/A000046/b000046.txt">Table of n, a(n) for n = 0..1000</a>
%H E. N. Gilbert and J. Riordan, <a href="http://projecteuclid.org/euclid.ijm/1255631587">Symmetry types of periodic sequences</a>, Illinois J. Math., 5 (1961), 657-665.
%H J. E. Iglesias, <a href="https://doi.org/10.1524/zkri.1981.155.1-2.121">A formula for the number of closest packings of equal spheres having a given repeat period</a>, Z. Krist. 155 (1981) 121-127, Table 1.
%H Sara Jensen, <a href="https://doi.org/10.1080/17513472.2023.2199375">Sequence knitting</a>, J. Math. Arts (2023).
%H Karyn McLellan, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p32">Periodic coefficients and random Fibonacci sequences</a>, Electronic Journal of Combinatorics, 20(4), 2013, #P32.
%H <a href="/index/Ne#necklaces">Index entries for sequences related to necklaces</a>
%F a(n) = Sum_{ d divides n } mu(d)*A000011(n/d).
%F From _Robert A. Russell_, Jun 19 2019: (Start)
%F a(n) = ((1/(2n))Sum_{odd d|n} mu(d)*2^(n/d) + Sum_{d|n} mu(n/d)*2^floor(d/2)) / 2.
%F a(n) = A000048(n) - A308706(n) = (A000048(n) + A179781(n))/2 = A308706(n) + A179781(n).
%F A000011(n) = Sum_{d|n} a(d). (End)
%e For a(7)=8, there are seven achiral set partitions (0000001, 0000011, 0000101, 0000111, 0001001, 0010011, 0010101) and one chiral pair (0001011-0001101). - _Robert A. Russell_, Jun 19 2019
%p with(numtheory); A000046 := proc(n) local s,d; if n = 0 then RETURN(1); else s := 0; for d in divisors(n) do s := s+mobius(d)*A000011(n/d); od; RETURN(s); fi; end;
%t a11[0] = 1; a11[n_] := 2^Floor[n/2]/2 + Sum[EulerPhi[2*d]*2^(n/d), {d, Divisors[n]}]/n/4; a[0] = 1; a[n_] := Sum[MoebiusMu[d]*a11[n/d], {d, Divisors[n]}]; Table[a[n], {n, 0, 36}] (* _Jean-François Alcover_, Jul 10 2012, from formula *)
%t Join[{1}, Table[(DivisorSum[NestWhile[#/2 &, n, EvenQ], MoebiusMu[#] 2^(n/#) &]/(2 n) + DivisorSum[n, MoebiusMu[n/#] 2^Floor[#/2] &])/2, {n, 1, 40}]] (* _Robert A. Russell_, Jun 19 2019 *)
%Y Similar to A000011, but counts primitive necklaces.
%Y A000048 (oriented), A308706 (chiral), A179781 (achiral).
%Y Cf. A054199.
%K nonn,easy,nice,changed
%O 0,5
%A _N. J. A. Sloane_
|
