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!)
A121773 Number of n-bead necklaces with n+1 colors for n>0, with a(0)=1. 1
1, 2, 6, 24, 165, 1560, 19684, 299600, 5381685, 111111340, 2593758618, 67546215528, 1941507500933, 61054982558024, 2085209014017960, 76861433640597376, 3041324492665174641, 128583032925805678368, 5784852794346334629910, 275941052631578947368440 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = (1/n)*Sum_{d|n} phi(n/d)*(n+1)^d, for n>0, with a(0)=1.
a(n) is divisible by (n+1); a(n)/(n+1) = A121774(n).
MATHEMATICA
a[0] = 1; a[n_] := DivisorSum[n, (n+1)^# * EulerPhi[n/#] &] / n; Array[a, 20, 0] (* Amiram Eldar, Aug 15 2023 *)
PROG
(PARI) a(n)=if(n==0, 1, (1/n)*sumdiv(n, d, eulerphi(n/d)*(n+1)^d))
CROSSREFS
Sequence in context: A038205 A012361 A308111 * A304996 A012711 A356579
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Aug 20 2006
EXTENSIONS
a(18)-a(19) from Amiram Eldar, Aug 15 2023
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 April 24 08:48 EDT 2024. Contains 371930 sequences. (Running on oeis4.)