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.

A327696 Number of n-bead necklace structures using an infinite alphabet that are not self-equivalent under a nonzero rotation.

Original entry on oeis.org

1, 1, 0, 1, 2, 10, 28, 125, 497, 2345, 11497, 61688, 350543, 2126495, 13631966, 92197099, 654982126, 4874404106, 37892942311, 306986431845, 2586206074833, 22612848380851, 204850698287662, 1919652428481928, 18581619383614327, 185543613289199731, 1908894095258021121
Offset: 0

Views

Author

Andrew Howroyd, Sep 22 2019

Keywords

Comments

Permuting the colors does not change the structure.

Crossrefs

Row sums of A327693.

Programs

  • PARI
    seq(n)={Vec(1 + intformal(sum(m=1, n, moebius(m)*subst(serlaplace(-1 + exp(sumdiv(m, d, (exp(d*x + O(x*x^(n\m)))-1)/d))), x, x^m))/x))}