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!)
A121774 Number of n-bead necklaces with n+1 colors, divided by (n+1), for n>0, with a(0)=1. 2

%I #18 Aug 15 2023 02:08:35

%S 1,1,2,6,33,260,2812,37450,597965,11111134,235796238,5628851294,

%T 149346730841,4361070182716,139013934267864,4803839602537336,

%U 178901440745010273,7143501829211426576,304465936544543927890,13797052631578947368422

%N Number of n-bead necklaces with n+1 colors, divided by (n+1), for n>0, with a(0)=1.

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

%F 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

%F a(n) = A121773(n)/(n+1). - _Amiram Eldar_, Aug 15 2023

%t a[n_] := DivisorSum[n, EulerPhi[n/#] * (n+1)^(#-1) &] / n; a[0] = 1; Array[a, 20, 0] (* _Amiram Eldar_, Aug 15 2023 *)

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

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

%o {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)}

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

%o for(n=0,20,print1(a(n),", ")) \\ _Paul D. Hanna_, Jul 18 2013

%Y Cf. A000010, A121773, A056665, A152290.

%K nonn

%O 0,3

%A _Paul D. Hanna_, Aug 20 2006

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)