Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A029808
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A029808 Number of Lyndon words (aperiodic necklaces) with 3n beads of 3 colors, n beads of each color. One color labeled, the other two unlabeled. +0
4
1, 7, 93, 1440, 25225, 476427, 9501737, 197197440, 4219878330, 92516600575, 2068590840349, 47010163129632, 1083052539395723, 25244912684662559, 594388664281931925, 14118181920797391360, 337939791145403719897 (list; graph; listen)
OFFSET

1,2

LINKS

Index entries for sequences related to Lyndon words

FORMULA

1/(6n) * sum over d|n of {mu(n/d) * (3d)! / d!^3}.

PROGRAM

(PARI) for(n=1, 23, print(1/(6*n)*sumdiv(n, d, moebius(n/d)*(3*d)!/d!^3)))

CROSSREFS

Inverse Witt transform of A006178.

Sequence in context: A027955 A124654 A006178 this_sequence A089915 A109304 A134113

Adjacent sequences: A029805 A029806 A029807 this_sequence A029809 A029810 A029811

KEYWORD

nonn

AUTHOR

Lionel Levine (levine(AT)ultranet.com)

EXTENSIONS

More terms from Jason Earls (zevi_35711(AT)yahoo.com), Aug 31 2001

Edited by Christian G. Bower (bowerc(AT)usa.net), Aug 28 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research