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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A261499 Number of necklaces with n white beads and 5*n black beads. 3

%I #16 Apr 30 2019 08:23:23

%S 1,1,6,46,446,4751,54132,642342,7861662,98480332,1256569506,

%T 16273981758,213378976004,2826867619109,37782553160820,

%U 508840821830546,6898459216311582,94070535317459018,1289430373206452136,17755914760643605782,245518560760433583946

%N Number of necklaces with n white beads and 5*n black beads.

%H Alois P. Heinz, <a href="/A261499/b261499.txt">Table of n, a(n) for n = 0..850</a>

%H F. Ruskey, <a href="http://combos.org/necklace">Necklaces, Lyndon words, De Bruijn sequences, etc.</a>

%H F. Ruskey, <a href="/A000011/a000011.pdf">Necklaces, Lyndon words, De Bruijn sequences, etc.</a> [Cached copy, with permission, pdf format only]

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Necklace.html">Necklace</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Necklace_(combinatorics)">Necklace (combinatorics)</a>

%H <a href="/index/Ne#necklaces">Index entries for sequences related to necklaces</a>

%F a(n) = 1/(6*n) * Sum_{d|n} C(6*n/d,n/d) * A000010(d) for n>0, a(0) = 1.

%F a(n) ~ 6^(6*n) / (2 * sqrt(3*Pi) * 5^(5*n+1/2) * n^(3/2)). - _Vaclav Kotesovec_, Aug 22 2015

%p with(numtheory):

%p a:= n-> `if`(n=0, 1, add(binomial(6*n/d, n/d)

%p *phi(d), d=divisors(n))/(6*n)):

%p seq(a(n), n=0..25);

%Y Column k=5 of A261494.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Aug 21 2015

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 August 17 16:24 EDT 2024. Contains 375227 sequences. (Running on oeis4.)