T(n, k) areis the number of n-ary necklaces of length k (see Ruskey, Savage and Wang). - Peter Luschny, Aug 12 2012, comment corrected at onthe suggestion of Petros Hadjicostas, Peter Luschny, Sep 10 2018
LINKS
Peter Luschny, <a href="/A054630/a054630.txt">Implementation of the FKM algorithm in SageMath and Julia</a>>.
H. Fredricksen and I. J. Kessler, An algorithm for generating necklaces of beads in two colors, Discrete Math. 61 (1986), 181-188.
LINKS
D. E. Knuth, Generating All Tuples and Permutations. The Art of Computer Programming, Vol. 4, Fascicle 2, Addison-Wesley, 2005.
Discussion
Wed Sep 12
16:15
Petros Hadjicostas: Hi Peter, I put a link to the paper by Fredricksen and Kessler. It is weird. It was referenced in 1978 as a paper to appear, but it appeared 6 years later! I also moved the Knuth reference to "REFERENCES" because it has no link. (In the next few days, I will create another sequence based on what you suggested.) - Petros