login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A337827 a(n) is the number of 2n-bead necklaces with exactly n different colored beads. 0
1, 4, 91, 5106, 510312, 79419180, 17758541160, 5397245416080, 2140495978440960, 1073686615987184640, 664582969579048732800, 497566995304189676342400, 443212653988584642449548800, 463237380681508395323231270400, 561422444732790213860755013145600, 780983354978825959061219179885824000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..16.

Wikipedia, Necklace combinatorics

FORMULA

a(n) = A087854(2*n,n) = (n!/(2*n)) * Sum_{d|2*n} phi(d) * S2(2*n/d, n) where S2(n,k) are the Stirling numbers of the second kind.

a(n) = (n!/(2*n))*(S2(2*n, n)+1) since S2(n, n) = 1 and S2(2*n/d, n) = 0 if d>2.

EXAMPLE

a(2) = 4, corresponding to the necklaces WBBB, WBWB, WWBB, and WWWB.

MATHEMATICA

Table[n! * (StirlingS2[2*n, n] + 1) / (2*n), {n, 1, 16}] (* Amiram Eldar, Sep 25 2020 *)

PROG

(PARI) T(n, k) = (k!/n) * sumdiv(n, d, eulerphi(d) * stirling(n/d, k, 2)); \\ A087854

vector(22, n, T(2*n, n)) \\ Joerg Arndt, Sep 25 2020

CROSSREFS

Cf. A087854, A007820.

Sequence in context: A195559 A195551 A024261 * A129434 A248041 A209984

Adjacent sequences: A337824 A337825 A337826 * A337828 A337829 A337830

KEYWORD

nonn

AUTHOR

Yves-Loic Martin, Sep 24 2020

EXTENSIONS

Terms a(6) and beyond from Joerg Arndt, Sep 25 2020

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 11:37 EST 2022. Contains 358493 sequences. (Running on oeis4.)