proposed
approved
proposed
approved
editing
proposed
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 *)
approved
editing
editing
approved
Number of n-bead necklaces labelled labeled with numbers -6..6 not allowing reversal, with sum zero.
Some solutions for n=4:
approved
editing
proposed
approved
editing
proposed
1, 7, 43, 371, 3431, 34153, 353333, 3770475, 41165305, 457714497, 5164908167, 58997692301, 680874861687, 7926902673655, 92986983743513, 1097999648804923, 13040634990748733, 155677447454317639, 1866995100779692627, 22482675584863229261
Column 6 of A208597
Andrew Howroyd, <a href="/A208595/b208595.txt">Table of n, a(n) for n = 1..100</a>
a(n) = (1/n) * Sum_{d | n} totient(n/d) * A201550(d). - Andrew Howroyd, Mar 02 2017
Column 6 of A208597.
R. H. Hardin , Feb 29 2012
a(15)-a(20) from Andrew Howroyd, Mar 02 2017
approved
editing
_R. H. Hardin (rhhardin(AT)att.net) _ Feb 29 2012
editing
approved