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!)
A056289 Number of primitive (period n) n-bead necklaces with exactly four different colored beads. 5

%I #18 Aug 22 2017 20:53:07

%S 0,0,0,6,48,260,1200,5100,20720,81828,318000,1222870,4675440,17813820,

%T 67769504,257695800,980240880,3731732200,14222737200,54278498154,

%U 207438936800,793940157900,3043140078000,11681056021300,44900438149248,172824327151140,666070256468960

%N Number of primitive (period n) n-bead necklaces with exactly four different colored beads.

%C Turning over the necklace is not allowed.

%D M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]

%H Alois P. Heinz, <a href="/A056289/b056289.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = Sum_{d|n} mu(d)*A056284(n/d).

%p with(numtheory):

%p b:= proc(n, k) option remember; `if`(n=0, 1,

%p add(mobius(n/d)*k^d, d=divisors(n))/n)

%p end:

%p a:= n-> add(b(n, 4-j)*binomial(4, j)*(-1)^j, j=0..4):

%p seq(a(n), n=1..30); # _Alois P. Heinz_, Jan 25 2015

%t b[n_, k_] := b[n, k] = If[n==0, 1, DivisorSum[n, MoebiusMu[n/#]*k^#&]/n]; a[n_] := Sum[b[n, 4-j]*Binomial[4, j]*(-1)^j, {j, 0, 4}]; Table[a[n], {n, 1, 30}] (* _Jean-François Alcover_, Feb 20 2017, after _Alois P. Heinz_ *)

%Y Cf. A027377.

%Y Column k=4 of A254040.

%K nonn

%O 1,4

%A _Marks R. Nester_

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)