A214310 a(n) is the number of all three-color bracelets (necklaces with turning over allowed) with n beads and the three colors are from a repertoire of n distinct colors, for n >= 3.
1, 24, 180, 1120, 5145, 23016, 91056, 357480, 1327095, 4893680, 17525508, 62254920, 217457695, 753332160, 2581110000, 8779264032, 29624681763, 99350001360, 331159123260, 1098168382080, 3624003213369, 11908069219816, 38972450763000, 127087400895000
Offset: 3
Keywords
Examples
a(5) = A213941(5,4) + A213941(5,5) = 60 + 120 = 180 from the bracelet (with colors j for c[j], j=1, 2, ..., 5) 11123 and 11213, both taken cyclically, each representing a class of order A035206(5,4)= 30 (if all 5 colors are used), and 11223, 11232, 12123 and 12213, all taken cyclically, each representing a class of order A035206(5,5)= 30. For example, cyclic(11322) becomes equivalent to cyclic(11223) by turning over or reflection. The multiplicity A035206 depends only on the color signature.
Links
- Andrew Howroyd, Table of n, a(n) for n = 3..100
Formula
Extensions
a(26) from Andrew Howroyd, Mar 25 2017
Comments