# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a208595
Showing 1-1 of 1

%I A208595 #12 Nov 01 2017 12:25:29
%S A208595 1,7,43,371,3431,34153,353333,3770475,41165305,457714497,5164908167,
%T A208595 58997692301,680874861687,7926902673655,92986983743513,
%U A208595 1097999648804923,13040634990748733,155677447454317639,1866995100779692627,22482675584863229261
%N A208595 Number of n-bead necklaces labeled with numbers -6..6 not allowing reversal, with sum zero.
%H A208595 Andrew Howroyd, <a href="/A208595/b208595.txt">Table of n, a(n) for n = 1..100</a>
%F A208595 a(n) = (1/n) * Sum_{d | n} totient(n/d) * A201550(d). - _Andrew Howroyd_, Mar 02 2017
%e A208595 Some solutions for n=4:
%e A208595 .-4...-5...-4...-6...-5...-3...-4...-1...-4...-6...-6...-4...-6...-1...-5...-4
%e A208595 ..4....2...-3....5....0....1....0....0....2...-1....3....2....5...-1....4....2
%e A208595 ..0...-1....4....1....0....2...-1....0...-3....1....2...-2...-4....0....2....4
%e A208595 ..0....4....3....0....5....0....5....1....5....6....1....4....5....2...-1...-2
%t A208595 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, 6]; Array[a, 20] (* _Jean-François Alcover_, Nov 01 2017, after _Andrew Howroyd_ *)
%Y A208595 Column 6 of A208597.
%K A208595 nonn
%O A208595 1,2
%A A208595 _R. H. Hardin_, Feb 29 2012
%E A208595 a(15)-a(20) from _Andrew Howroyd_, Mar 02 2017

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE