|
|
A213943
|
|
Row sums of partition array A213939 and triangle A213940: number of representative bracelets with n beads and up to n colors.
|
|
3
|
|
|
1, 2, 3, 9, 28, 144, 832, 6012, 48447, 444198, 4469834, 49650464, 597810739, 7809600123, 109524985564, 1646900490716, 26373465572350, 448901183773766, 8083772124339442, 153686286512223573, 3074405841292532560, 64582422678961767945
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
See A213939 for representative bracelets of a color class defined by a signature, given by a partition.
If color c[j] is written as j, for j from {1, 2, ... ,n}, the representative multisets, corresponding to the bracelets in question, are the ones with the least sum of their members.
E.g., n=4, m=3: signature [2,1,1] (partition of n with 4 parts), representative multiset (written as an ordered list by convention) [1,1,2,3], with the two representative bracelets 1123 and 1213, both taken cyclically.
Number of bracelets with n beads over a 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. - Andrew Howroyd, Dec 21 2017
|
|
LINKS
|
|
|
FORMULA
|
a(n) = sum(A213940(n,m),m=1..n), n >= 1.
|
|
EXAMPLE
|
The a(4)= 9 representative bracelets are (j for c[j]): 1111, 1112, 1122, 1212, 1123, 1213, 1234, 1324 and 1243, all taken cyclically.
|
|
PROG
|
(PARI)
a(n)={ if(n==0, 1, my(p=serlaplace(prod(k=1, n, 1/(1-x^k/k!) + O(x*x^n))));
my(c=sumdiv(n, d, eulerphi(n/d)*polcoeff(p, d))/n);
my(r=if(n%2, sum(d=0, (n-1)/2, binomial((n-1)/2, d)*polcoeff(p, d)), polcoeff(p, n/2) + sum(d=0, n/2-1, binomial(n/2-1, d)*polcoeff(p, n/2-1-d)*(2^d + if(d%2, 0, binomial(d, d/2))))/2));
|
|
CROSSREFS
|
Cf. A072605 (representative necklaces).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|