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.

A032165 Number of aperiodic necklaces of n beads of 10 colors.

Original entry on oeis.org

10, 45, 330, 2475, 19998, 166485, 1428570, 12498750, 111111000, 999989991, 9090909090, 83333249175, 769230769230, 7142856428565, 66666666659934, 624999993750000, 5882352941176470, 55555555499944500
Offset: 1

Views

Author

Keywords

Crossrefs

Column 10 of A074650.

Programs

  • Mathematica
    f[d_]:=MoebiusMu[d] 10^(n/d)/n; a[n_]:=Total[f/@Divisors[n]]; a[0]=1; Table[a[n], {n, 1, 20}] (* Vincenzo Librandi, Oct 14 2017 *)
  • PARI
    a(n) = sumdiv(n, d, moebius(d)*10^(n/d))/n; \\ Andrew Howroyd, Oct 13 2017

Formula

"CHK" (necklace, identity, unlabeled) transform of 10, 0, 0, 0...
a(n) = Sum_{d|n} mu(d)*10^(n/d)/n.
G.f.: Sum_{k>=1} mu(k)*log(1/(1 - 10*x^k))/k. - Ilya Gutkovskiy, May 19 2019