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.
%I A346773 #25 Dec 14 2021 00:23:45
%S A346773 1,2,0,2,0,4,0,2,0,4,0,4,0,4,0,2,0,4,0,4,0,4,0,4,0,4,0,4,0,8,0,2,0,4,
%T A346773 0,4,0,4,0,4,0,8,0,4,0,4,0,4,0,4,0,4,0,4,0,4,0,4,0,8,0,4,0,2,0,8,0,4,
%U A346773 0,8,0,4,0,4,0,4,0,8,0,4,0,4,0,8,0,4,0,4,0,8,0,4,0,4,0,4,0,4,0,4,0,8,0
%N A346773 a(n) = Sum_{d|n} möbius(d)^n.
%H A346773 Antti Karttunen, <a href="/A346773/b346773.txt">Table of n, a(n) for n = 1..20000</a>
%F A346773 G.f.: Sum_{k>=1} (mu(k)*x)^k/(1 - (mu(k)*x)^k).
%F A346773 a(2*n-1) = 0^(n-1) and a(2*n) = A034444(2*n) = A100008(n) for n > 0.
%t A346773 Table[Sum[MoebiusMu[d]^n,{d,Divisors[n]}],{n,103}] (* _Stefano Spezia_, Aug 03 2021 *)
%o A346773 (PARI) a(n) = sumdiv(n, d, moebius(d)^n);
%o A346773 (PARI) a(n) = if(n%2, 0^(n-1), 2^omega(2*n));
%o A346773 (PARI) N=99; x='x+O('x^N); Vec(sum(k=1, N, (moebius(k)*x)^k/(1-(moebius(k)*x)^k)))
%Y A346773 Cf. A008683, A023887, A034444, A068068, A080323, A100008, A264782.
%K A346773 nonn,easy
%O A346773 1,2
%A A346773 _Seiichi Manyama_, Aug 03 2021