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 A323885 #12 Jul 13 2022 20:18:24 %S A323885 2,0,0,4,0,4,0,4,1,4,0,2,0,4,2,5,0,2,0,2,2,4,0,4,1,4,1,2,0,0,0,6,2,4, %T A323885 2,3,0,4,2,4,0,0,0,2,1,4,0,5,1,2,2,2,0,2,2,4,2,4,0,4,0,4,1,7,2,0,0,2, %U A323885 2,0,0,4,0,4,1,2,2,0,0,5,1,4,0,4,2,4,2,4,0,2,2,2,2,4,2,6,0,2,1,3,0,0,0,4,0 %N A323885 Sum of A001511 and its Dirichlet inverse. %H A323885 Antti Karttunen, <a href="/A323885/b323885.txt">Table of n, a(n) for n = 1..65537</a> %F A323885 a(n) = A001511(n) + A092673(n). %o A323885 (PARI) %o A323885 A001511(n) = (1+valuation(n,2)); %o A323885 A092673(n) = (moebius(n)-if(n%2,0,moebius(n/2))); %o A323885 A323885(n) = (A001511(n)+A092673(n)); %o A323885 (Python) %o A323885 from sympy import mobius %o A323885 def A323885(n): return (n&-n).bit_length()+mobius(n)-(0 if n&1 else mobius(n>>1)) # _Chai Wah Wu_, Jul 13 2022 %Y A323885 Cf. A001511, A092673. %Y A323885 Cf. also A318449, A318450, A323365, A323882, A323884, A323887, A323896. %K A323885 nonn %O A323885 1,1 %A A323885 _Antti Karttunen_, Feb 08 2019