Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005648
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005648 Number of 2n-bead black-white reversible necklaces with n black beads.
(Formerly M0878)
+0
7
1, 1, 2, 3, 8, 16, 50, 133, 440, 1387, 4752, 16159, 56822, 200474, 718146, 2587018, 9398520, 34324174, 126068558, 465093571, 1723176308, 6407924300, 23910576230, 89494164973, 335913918902, 1264107416466 (list; graph; listen)
OFFSET

0,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Ascher, Marcia; Mu torere: an analysis of a Maori game. Math. Mag. 60 (1987), no. 2, 90-100.

E. M. Palmer and R. W. Robinson, Enumeration of self-dual configurations, Pacific J. Math., 110 (1984), 203-221.

LINKS

F. Ruskey, Necklaces, Lyndon words, De Bruijn sequences, etc.

Index entries for sequences related to bracelets

FORMULA

a(n) = (Sum_{d|n} (phi(n/d)*C(2d, d))/(2n) + C(2k, k))/2), where k = floor(n/2).

(A003239(n) + C(2k, k))/2, where k = [ n/2 ] (R. J. Fletcher, yylee(AT)mail.ncku.edu.tw).

EXAMPLE

a(2) = 2: BBWW, BWBW.

a(3) = 3: BBBWWW, BBWBWW, BWBWBW.

a(4) = 8: BBBBWWWW, BBBWBWWW, BBBWWBWW, BBWWBBWW, BBWBWBWW, BBWWBWBW, BBWBBWWW, BWBWBWBW.

MATHEMATICA

f[k_Integer, n_] := (Plus @@ (EulerPhi[ # ]Binomial[n/#, k/# ] & /@ Divisors[GCD[n, k]])/n + Binomial[(n - If[OddQ@n, 1, If[OddQ@k, 2, 0]])/2, (k - If[OddQ@k, 1, 0])/2])/2 - Robert A. Russell (russell(AT)post.harvard.edu), Sep 27 2004

Table[ f[n, 2n], {n, 27}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Mar 29 2006)

PROGRAM

(PARI) a(n) = 1/2*( C(2*(n\2), n\2) + if(n<1, n >= 0, sumdiv(n, k, eulerphi(k)*C(2*n/k, n/k))/(2*n) )) where C(n, k)= if(k<0|k>n, 0, n!/k!/(n-k)!)

CROSSREFS

Cf. A000984, A003239. a(n)= (1/2) *(A000984([ n/2 ])+A003239(n)) (R. J. Fletcher, yylee(AT)mail.ncku.edu.tw).

Sequence in context: A011952 A032104 A051573 this_sequence A113947 A102008 A158921

Adjacent sequences: A005645 A005646 A005647 this_sequence A005649 A005650 A005651

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Sequence extended and description corrected by Christian G. Bower (bowerc(AT)usa.net). Formula from Michael Somos.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research