cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A045676 Number of 2n-bead balanced binary necklaces which are equivalent to their reverse, but not equivalent to their complement and reversed complement.

Original entry on oeis.org

0, 0, 0, 0, 2, 2, 14, 12, 58, 54, 232, 220, 886, 860, 3360, 3304, 12730, 12614, 48348, 48108, 184224, 183732, 704376, 703384, 2702070, 2700060, 10396440, 10392408, 40108336, 40100216, 155101008, 155084752, 601047482, 601014854, 2333540428
Offset: 0

Views

Author

Keywords

Comments

The number of 2n-bead balanced binary necklaces equivalent to their reverse is A128014(n) and those equivalent to their reverse, complement and reversed complement is A045674(n). - Andrew Howroyd, Sep 28 2017

Crossrefs

Programs

Formula

a(n) = A128014(n) - A045674(n). - Andrew Howroyd, Sep 28 2017

A045686 Number of 2n-bead balanced binary necklaces of fundamental period 2n which are equivalent to their complement, but not equivalent to their reverse and their reversed complement.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 2, 2, 8, 14, 36, 62, 140, 252, 522, 968, 1920, 3600, 7028, 13286, 25704, 48914, 94302, 180314, 347480, 666996, 1286460, 2477328, 4785300, 9240012, 17879314, 34604066, 67076096, 130084990, 252579600, 490722342, 954306080
Offset: 0

Views

Author

Keywords

Comments

The number of length 2n balanced binary Lyndon words which are equivalent to their complement is A000048(n) and the number which are equivalent to their reverse, complement and reversed complement is A045683(n). - Andrew Howroyd, Sep 28 2017

Crossrefs

Programs

  • Mathematica
    a48[n_] := Total[MoebiusMu[#]*2^(n/#)& /@ Select[Divisors[n], OddQ]]/(2n);
    b[n_] := Module[{t = 0, r = n}, While[EvenQ[r], r = Quotient[r, 2]; t += 2^(r - 1)]; t + 2^Quotient[r, 2]];
    a45683[n_] := DivisorSum[n, MoebiusMu[n/#]*b[#]&];
    a[n_] := If[n == 0, 0, a48[n] - a45683[n]];
    a /@ Range[0, 36] (* Jean-François Alcover, Sep 23 2019, after Andrew Howroyd *)

Formula

From Andrew Howroyd, Sep 28 2017: (Start)
Moebius transform of A045677.
a(n) = A000048(n) - A045683(n).
(End)
Showing 1-2 of 2 results.