|
|
A208596
|
|
Number of n-bead necklaces labeled with numbers -7..7 not allowing reversal, with sum zero.
|
|
2
|
|
|
1, 8, 57, 568, 6077, 69784, 833253, 10259448, 129245091, 1658145128, 21589248803, 284548542120, 3789094334455, 50900085245304, 688944374917247, 9386664978851448, 128633790260673263, 1771859642698543096, 24518513933529549357, 340679786167936420216
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Some solutions for n=4:
.-4...-7...-7...-7...-4...-3...-3...-5...-2...-5...-7...-6...-6...-7...-6...-7
..0....4...-1....6....2...-3...-1....1....0...-3....6....3....5....1...-1...-2
..6....3....2...-1....1...-1...-2....7....1....3...-3...-3....5....7....0....4
.-2....0....6....2....1....7....6...-3....1....5....4....6...-4...-1....7....5
|
|
MATHEMATICA
|
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, 7]; Array[a, 20] (* Jean-François Alcover, Nov 01 2017, after Andrew Howroyd *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|