Triangle with entry a(n,m) giving the number of bracelets of n beads (dihedral D_n symmetry) with n colors available for each bead, but only m distinct fixed colors, say c[1],...,c[m], are present, with m from {1,...,n} and n>=1.

A213940

Triangle with entry a(n,m) giving the number of bracelets of n beads (dihedral D_n symmetry) with n colors available for each bead, but only m distinct fixed colors, say c[1],...,c[m], are present, with m from {1,...,n} and n>=1.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =3a(8) =2a(9) =3a(10) =1a(11) =3a(12) =6a(13) =6a(14) =12a(15) =1a(16) =7a(17) =20a(18) =26a(19) =30a(20) =60a(21) =1a(22) =8a(23) =40a(24) =93a(25) =150a(26) =180a(27) =360a(28) =1a(29) =18

External references