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.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A208186 Number of distinct n-colored necklaces with 5 beads per color. 2
 1, 1, 26, 50452, 586637256, 24934429725024, 2961088201992945120, 823940558733748910598720, 474389544274867071519255599040, 515190840198859838606483730223480320, 982409170121762644481286121423409538362880, 3106878824601775580798512171862746898249905228800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..50 FORMULA a(n) = Sum_{d|5} phi(5/d)*(n*d)!/(d!^n*n*5) if n>0 and a(0) = 1. EXAMPLE a(0) = 1: the empty necklace. a(1) = 1: {00000}. a(2) = 26: {0000011111, ..., 0101010101}. MAPLE with(numtheory); a:= n-> `if`(n=0, 1, add(phi(5/d) *(n*d)!/(d!^n *5*n), d={1, 5})): seq(a(n), n=0..12); CROSSREFS Row n=5 of A208183. Cf. A000010, A000142. Sequence in context: A359052 A209961 A302396 * A316677 A092212 A365983 Adjacent sequences: A208183 A208184 A208185 * A208187 A208188 A208189 KEYWORD nonn AUTHOR Alois P. Heinz, Feb 24 2012 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.

Last modified June 13 17:32 EDT 2024. Contains 373391 sequences. (Running on oeis4.)