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_, k_] := DivisorSum[n, EulerPhi[n/#] comps[#*(k + 1), 2 k + 1, #] &]/n; a[n_] := a[n, n]; Array[a, 18] (* Jean-François Alcover, Nov 01 2017, after Andrew Howroyd *)
approved
editing
editing
approved
Number of n-bead necklaces labelled labeled with numbers -n..n not allowing reversal, with sum zero.
All solutions for n=3:
approved
editing
proposed
approved
editing
proposed
1, 3, 13, 125, 1761, 34153, 833253, 24627705, 855798877, 34223775091, 1549090700059, 78325577416281, 4376902102440375, 267933660979057571, 17834397187887850661, 1282662234529669344753, 99133711906097886767313, 8194555387462964814207631
Diagonal of A208597
Andrew Howroyd, <a href="/A208590/b208590.txt">Table of n, a(n) for n = 1..80</a>
Diagonal of A208597.
R. H. Hardin , Feb 29 2012
a(12)-a(18) from Andrew Howroyd, Mar 02 2017
approved
editing
_R. H. Hardin (rhhardin(AT)att.net) _ Feb 29 2012
editing
approved