login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121774 Number of n-bead necklaces with n+1 colors, divided by (n+1), for n>0, with a(0)=1. 2
1, 1, 2, 6, 33, 260, 2812, 37450, 597965, 11111134, 235796238, 5628851294, 149346730841, 4361070182716, 139013934267864, 4803839602537336, 178901440745010273, 7143501829211426576, 304465936544543927890 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..18.

FORMULA

a(n) = (1/n)*Sum_{d|n} phi(n/d)*(n+1)^(d-1), for n>0, with a(0)=1.

a(n) = Sum_{k=0..[n/2]} A152290(n, n*k), where A152290 is a triangle of coefficients in a q-analog of the LambertW function. - Paul D. Hanna, Jul 18 2013

PROG

(PARI) a(n)=if(n==0, 1, (1/n)*sumdiv(n, d, eulerphi(n/d)*(n+1)^(d-1)))

(PARI) /* a(n) = Sum_{k=0..[n/2]} A152290(n, n*k):  */

{A152290(n, k)=local(e_q=1+sum(j=1, n, x^j/prod(i=1, j, (q^i-1)/(q-1))), LW_q=serreverse(x/e_q+x^2*O(x^n))/x); polcoeff(polcoeff(LW_q+x*O(x^n), n, x)*prod(i=1, n, (q^i-1)/(q-1))+q*O(q^k), k, q)}

{a(n)=sum(k=0, n\2, A152290(n, n*k))}

for(n=0, 20, print1(a(n), ", ")) \\ Paul D. Hanna, Jul 18 2013

CROSSREFS

Cf. A121773, A056665, A152290.

Sequence in context: A127114 A138909 A138983 * A209238 A053042 A174432

Adjacent sequences:  A121771 A121772 A121773 * A121775 A121776 A121777

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Aug 20 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 12 19:50 EDT 2021. Contains 342932 sequences. (Running on oeis4.)