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.

A326888 Number of length n asymmetric bracelets with integer entries that cover an initial interval of positive integers.

This page as a plain text file.
%I A326888 #17 Sep 16 2019 04:29:45
%S A326888 0,0,1,6,48,369,3341,33960,393467,5111052,73753685,1170468816,
%T A326888 20263758984,380047813297,7676106093000,166114206886740,
%U A326888 3834434320842720,94042629507381957,2442147034668044933,66942194905675830162,1931543452344523775050,58519191359155952404837
%N A326888 Number of length n asymmetric bracelets with integer entries that cover an initial interval of positive integers.
%C A326888 Asymmetric bracelets are those primitive (period n) bracelets that when turned over are different from themselves.
%H A326888 Andrew Howroyd, <a href="/A326888/b326888.txt">Table of n, a(n) for n = 1..200</a>
%F A326888 Moebius transform of A326895.
%e A326888 For n = 4, the six asymmetric bracelets are  1123, 1223, 1233, 1234, 1243, 1324.
%o A326888 (PARI) \\ U(n,k) is A309528
%o A326888 U(n,k)={sumdiv(n, d, moebius(n/d)*(k^d/n - if(d%2, k^((d+1)/2), (k+1)*k^(d/2)/2)))/2}
%o A326888 a(n)={sum(k=1, n, U(n,k)*sum(r=k, n, binomial(r, k)*(-1)^(r-k)))}
%Y A326888 Row sums of A309651.
%Y A326888 Cf. A309528.
%K A326888 nonn
%O A326888 1,4
%A A326888 _Andrew Howroyd_, Sep 12 2019