The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212359 Partition array for the number of representative necklaces (only cyclic symmetry) with n beads, each available in n colors. Only the color type (signature) matters. 14
 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 6, 1, 1, 2, 4, 6, 12, 24, 1, 1, 3, 4, 5, 10, 16, 20, 30, 60, 120, 1, 1, 3, 5, 6, 15, 20, 30, 30, 60, 90, 120, 180, 360, 720, 1, 1, 4, 7, 10, 7, 21, 35, 54, 70, 42, 105, 140, 210, 318, 210, 420, 630, 840, 1260, 2520, 5040 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS The row lengths sequence is A000041(n), n>=1. The partitions are ordered like in Abramowitz-Stegun (A-St order). For the reference see A036036, where also a link to a work by C. F. Hindenburg from 1779 is found where this order has been used. A necklace with n beads (n-necklace) has here only the cyclic C_n symmetry group. This is in contrast to, e.g., the Harary-Palmer reference, p. 44, where a n-necklace has the symmetry group D_n, the dihedral group of degree n (order 2n), which allows, in addition to C_n operations, also a turnover (in 3-space) or a reflection (in 2-space). The necklace number a(n,k) gives the number of n-necklaces, with up to n colors for each bead, belonging to the k-th partition of n in A-St order in the following way. Write this partition with nonincreasing parts (this is the reverse of the partition as given by A-St), e.g., [3,1^2], not [1^2,3], is written as [3,1,1], a partition of n=5. In general [p,p,...,p[m]], with p>=p>=...>=p[m]>=1, with m the number of parts. To each such partition of n corresponds an n-multiset obtained by 'exponentiation'. For the given example the 5-multiset is {1^3,2^1,3^1}={1,1,1,2,3}. In general {1^p,2^p,...,m^p[m]}. Such an n-multiset representative (of a repetition class defined by the exponents, sometimes called signature) encodes the n-necklace color monomial by c^p*c^p*...*c[m]^p[m]. For the example one has c^3*c*c. The number of 5-necklaces with this color assignment is a(5,4) because [3,1,1] is the 4th partition of 5 in A-St order. The a(5,4)=4 non-equivalent 5-necklaces with this color assignment are cyclic(ccccc), cyclic(ccccc), cyclic(ccccc) and cyclic(ccccc). Such a set of a(n,k) n-necklaces for the given color assignment stands for other sets of the same order where different colors from the repertoire {c,...,c[n]} are chosen. In the example, the partition [3,1,1]  with the representative multiset [1^3,2,3] stands for all-together 5*binomial(4,2) = 30 such sets, each leading to 4 possible non-equivalent 5-necklace arrangements. Thus one has, in total, 30*4=120 5-necklaces with color signature determined from the partition [3,1,1]. See the partition array A212360 for these numbers. For the example n=4, k=1..5, see the Stanley reference, last line, where the numbers a(4,k) are, in A-St order, 1, 1, 2, 3, 6, summing to A072605(4). a(n,k) is computed from the cycle index Z(C_n) for the cyclic group (see A212357 and the link given there) after the variables x_j have been replaced by the j-th power sum sum(c[i]^j,i=1..n), abbreviated as Z(C_n,c_n) with c_n:=sum(c[i],i=1..n), n>=1. The coefficient of the color assignment representative determined by the k-th partition of n in A-St order, as explained above, is a(n,k). See the Harary-Palmer reference, p. 36, Theorem (PET) with A=C_n and p. 36 eq. (2.2.10) for the cycle index polynomial Z(C_n). See the W. Lang link for more details. The corresponding triangle with summed entries of row n which belong to partitions of n with the same number of parts is A213934. [Wolfdieter Lang, Jul 12 2012] REFERENCES F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 36, (2.2.10). R. Stanley, Enumerative combinatorics, Vol. 2, Cambridge University Press, Cambridge, 1999, p. 392, 7.24.3 Example. LINKS Álvar Ibeas, First 25 rows, flattened Wolfdieter Lang, Rows n=1..15 and color polynomials n=1..10. FORMULA a(n,k) is the number of necklace arrangements with n beads (respecting the cyclic C_n symmetry) with color assignment given by the multiset representative obtained uniquely from the k-th partition of n in A-St order. See the comment for more details and the A-St reference. From Álvar Ibeas, Dec 12 2020: (Start) Let L be the k-th partition of n in A-St and d be the gcd of its parts. Abusing the notation, we write a(n, L) for a(n, k) and accordingly for other partition arrays. a(n, L) = n^(-1) * Sum_{v|d} phi(v) * A036038(n/v, L/v), where L/v is the partwise division of L by v. a(n, L) = Sum_{v|d} A339677(L/v). (End) EXAMPLE n\k  1 2 3 4 5  6  7  8  9 10  11  12  13  14  15 1    1 2    1 1 3    1 1 2 4    1 1 2 3 6 5    1 1 2 4 6 12 24 6    1 1 3 4 5 10 16 20 30 60 120 7    1 1 3 5 6 15 20 30 30 60  90 120 180 360 720 ... See the link for the rows n=1..15 and the corresponding color polynomials for n=1..10. a(4,5)=6 because the partition in question is 1^4, the corresponding color type representative multinomial is c*c*c*c (all four colors are involved), and there are the 6 C_4 non-equivalent 4-necklaces (we use here j for color c[j]): 1234, 1243, 1324, 1342, 1423 and 1432 (all taken as cyclically). For this partition there is only one color choice. a(4,4)=3 because the partition is [2,1^2]=[2,1,1], the color representative monomial is c^2*c*c, and the arrangements are 1123, 1132  and  1213 (all taken cyclically). There are, in total, 4*binomial(3,2)=12 color multinomials of this signature (color type) in Z(C_4,c_4). CROSSREFS Cf. A212357 for Z(C_n), A072605 for the row sums. A212360, A213934. Sequence in context: A169786 A191631 A025259 * A130030 A088022 A284999 Adjacent sequences:  A212356 A212357 A212358 * A212360 A212361 A212362 KEYWORD nonn,tabf AUTHOR Wolfdieter Lang, Jun 25 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 14:44 EDT 2022. Contains 357073 sequences. (Running on oeis4.)