[go: up one dir, main page]

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!)
Revision History for A045628 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A045628 Number of 2n-bead black-white reversible necklaces with n black beads and fundamental period 2n.
(history; published version)
#19 by Bruno Berselli at Wed Aug 28 08:15:05 EDT 2019
STATUS

reviewed

approved

#18 by Joerg Arndt at Wed Aug 28 06:46:08 EDT 2019
STATUS

proposed

reviewed

#17 by Jean-François Alcover at Wed Aug 28 06:39:44 EDT 2019
STATUS

editing

proposed

#16 by Jean-François Alcover at Wed Aug 28 06:39:40 EDT 2019
MATHEMATICA

a[n_] := If[n == 0, 1, Sum[MoebiusMu[n/d] (2n Binomial[ 2 Quotient[d, 2], Quotient[d, 2]] + Binomial[2d, d]), {d, Divisors[n]}]/(4n)];

Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Aug 28 2019, from PARI *)

STATUS

approved

editing

#15 by Alois P. Heinz at Fri Sep 29 17:57:12 EDT 2017
STATUS

proposed

approved

#14 by Andrew Howroyd at Fri Sep 29 17:15:23 EDT 2017
STATUS

editing

proposed

#13 by Andrew Howroyd at Fri Sep 29 17:13:56 EDT 2017
FORMULA

a(n) = 1/(4*n) * Sum_{d|n} mu(n/d) * (2*n*binomial(2*(*floor(d\/2), floor(d\/2) + )) + binomial(2*d, d)) for n > 0. - Andrew Howroyd, Sep 28 2017

Discussion
Fri Sep 29 17:14
Andrew Howroyd: Thanks for spotting that!
#12 by Alois P. Heinz at Fri Sep 29 17:07:10 EDT 2017
FORMULA

Moebius transform of A005648. - . - _Christian G. Bower_

STATUS

proposed

editing

Discussion
Fri Sep 29 17:08
Alois P. Heinz: could you rewrite "d\2" in formula section please?
#11 by Andrew Howroyd at Fri Sep 29 16:17:56 EDT 2017
STATUS

editing

proposed

#10 by Andrew Howroyd at Thu Sep 28 22:01:05 EDT 2017
LINKS

Andrew Howroyd, <a href="/A045628/b045628.txt">Table of n, a(n) for n = 0..200</a>

FORMULA

Moebius transform of A005648 (. - Christian Bower).

a(n) = 1/(4*n) * Sum_{d|n} mu(n/d) * (2*n*binomial(2*(d\2), d\2) + binomial(2*d, d)) for n > 0. - Andrew Howroyd, Sep 28 2017

PROG

(PARI) a(n) = if(n<1, n==0, sumdiv(n, d, moebius(n/d)*(2*n*binomial(2*(d\2), d\2) + binomial(2*d, d)))/(4*n)); \\ Andrew Howroyd, Sep 28 2017

CROSSREFS

Cf. A005648.

STATUS

approved

editing

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 August 30 07:09 EDT 2024. Contains 375532 sequences. (Running on oeis4.)