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

%I #17 Jun 06 2018 14:31:47

%S 0,0,0,0,0,120,2160,23940,211680,1643544,11748240,79419060,516257280,

%T 3262440960,20193277104,123071683140,741419995680,4427489935680,

%U 26264144909520,155018839412052,911509010152560,5344538372696880,31272099902089200,182707081042818360

%N Number of primitive (period n) n-bead necklaces with exactly six 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="/A056291/b056291.txt">Table of n, a(n) for n = 1..1000</a>

%F Sum mu(d)*A056286(n/d) where d|n.

%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, 6-j)*binomial(6, j)*(-1)^j, j=0..6):

%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];

%t a[n_] := Sum[b[n, 6 - j]*Binomial[6, j]*(-1)^j, {j, 0, 6}];

%t Table[a[n], {n, 1, 30}] (* _Jean-François Alcover_, Jun 06 2018, after _Alois P. Heinz_ *)

%Y Cf. A032164.

%Y Column k=6 of A254040.

%K nonn

%O 1,6

%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 11:31 EDT 2024. Contains 371792 sequences. (Running on oeis4.)