The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A075147 Number of Lyndon words (aperiodic necklaces) with n beads of n colors. 6
1, 1, 8, 60, 624, 7735, 117648, 2096640, 43046640, 999989991, 25937424600, 743008120140, 23298085122480, 793714765724595, 29192926025339776, 1152921504338411520, 48661191875666868480, 2185911559727674682148, 104127350297911241532840, 5242879999999487999992020 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = (1/n) * Sum_{d|n} mu(n/d)*n^d.
Asymptotic to n^(n-1) = A000169(n).
a(n) is the n-th term of the inverse Euler transform of j-> n^j. - Alois P. Heinz, Jun 23 2018
a(n) = [x^n] Sum_{k>=1} mu(k)*log(1/(1 - n*x^k))/k. - Ilya Gutkovskiy, May 20 2019
MAPLE
with(numtheory):
a:= n-> add(n^d *mobius(n/d), d=divisors(n))/n:
seq(a(n), n=1..25); # Alois P. Heinz, Dec 21 2014
MATHEMATICA
Table[Total@Map[ MoebiusMu[#1] n^(n/#1 - 1) &, Divisors[n]], {n, 20}] (* Olivier Gérard, Aug 05 2016 *)
CROSSREFS
Main diagonal of A074650 and A143325.
Sequence in context: A099337 A356595 A356598 * A034664 A242084 A007399
KEYWORD
nonn
AUTHOR
Christian G. Bower, Sep 04 2002
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 May 14 10:37 EDT 2024. Contains 372532 sequences. (Running on oeis4.)