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!)
A208184 Number of distinct n-colored necklaces with 3 beads per color. 2
1, 1, 4, 188, 30804, 11211216, 7623616080, 8690922240480, 15391623287043360, 40018220546304026880, 146226577876194816241920, 725283826265926287362419200, 4746982642910487550771226611200, 40045545575592872978305843519334400 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = Sum_{d|3} phi(3/d)*(n*d)!/(d!^n*n*3) if n>0 and a(0) = 1.
For n > 0, a(n) = (3*n)!/(3*n*6^n) + 2*(n-1)!/3. - Vaclav Kotesovec, Aug 23 2015
EXAMPLE
a(0) = 1: the empty necklace.
a(1) = 1: {000}.
a(2) = 4: {000111, 001011, 010011, 010101}.
MAPLE
with(numtheory);
a:= n-> `if`(n=0, 1, add(phi(3/d) *(n*d)!/(d!^n *3*n), d={1, 3})):
seq(a(n), n=0..20);
MATHEMATICA
Flatten[{1, Table[(3*n)!/(3*n*6^n) + 2*(n-1)!/3, {n, 1, 20}]}] (* Vaclav Kotesovec, Aug 23 2015 *)
CROSSREFS
Row n=3 of A208183.
Sequence in context: A358809 A266492 A285882 * A355613 A172809 A123116
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Feb 24 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 13:40 EDT 2024. Contains 371792 sequences. (Running on oeis4.)