A Problem of Enumeration of Two-color Bracelets with Several Variations

Vladimir Shevelev


We consider the problem of enumeration of incongruent two-color bracelets of $n$ beads, $k$ of which are black, and study several natural variations of this problem. We also give recursion formulas for enumeration of $t$-color bracelets, $t\geq3$.


Two-color and multi-color bracelets; Convex $k$-gons; Generalized Fibonacci numbers

Full Text:


DOI: http://dx.doi.org/10.26713%2Fjims.v3i3.55

eISSN 0975-5748; pISSN 0974-875X