Number of necklaces with n beads over an n-ary alphabet {a1,a2,...,an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 0, where #(w,x) counts the letters x in word w.

A072605

Number of necklaces with n beads over an n-ary alphabet {a1,a2,...,an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 0, where #(w,x) counts the letters x in word w.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =4a(4) =13a(5) =50a(6) =270a(7) =1641a(8) =11945a(9) =96784a(10) =887982a(11) =8939051a(12) =99298354a(13) =1195617443a(14) =15619182139a(15) =219049941201

External references