login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A032179
Number of necklaces with n labeled beads of 3 colors.
0
3, 9, 54, 486, 5832, 87480, 1574640, 33067440, 793618560, 21427701120, 642831033600, 21213424108800, 763683267916800, 29783647448755200, 1250913192847718400, 56291093678147328000, 2701972496551071744000, 137800597324104658944000, 7441232255501651582976000
OFFSET
1,1
LINKS
C. G. Bower, Transforms (2)
Alexsandar Petojevic, The Function vM_m(s; a; z) and Some Well-Known Sequences, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.7
FORMULA
"CIJ" (necklace, indistinct, labeled) transform of 3, 0, 0, 0...
E.g.f.: log(1/(1-3*x)).
a(n) = 3^n * (n-1)!. - Vaclav Kotesovec, Jan 05 2014
D-finite with recurrence: a(n) +3*(-n+1)*a(n-1)=0. - R. J. Mathar, Jan 28 2020
MATHEMATICA
s=3; lst={s}; Do[s+=n*s+s; AppendTo[lst, s], {n, 1, 5!, 3}]; lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
Rest[With[{nn=20}, CoefficientList[Series[Log[1/(1-3x)], {x, 0, nn}], x] Range[0, nn]!]] (* Harvey P. Dale, Sep 22 2011 *)
PROG
(PARI) Vec(serlaplace(log(1/(1-3*'x+O('x^66))))) /* Joerg Arndt, Jan 25 2013 */
CROSSREFS
Sequence in context: A337039 A025226 A001194 * A377340 A233189 A175117
KEYWORD
nonn,easy
STATUS
approved