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 A053734 #12 Mar 26 2022 11:09:16
%S A053734 0,0,1,0,1,1,1,0,2,1,1,2,1,1,5,0,1,6,1,2,11,1,1,16,4,1,30,2,1,57,1,0,
%T A053734 95,1,13,172,1,1,317,16,1,591,1,2,1124,1,1,2048,10,52,3857,2,1,7286,
%U A053734 97,16,13799,1,1,26386,1,1,49968,0,319,95331,1,2,182363
%N A053734 A000016-A000048 (when they are lined up so that the two 16's match).
%H A053734 Michael De Vlieger, <a href="/A053734/b053734.txt">Table of n, a(n) for n = 1..10000</a>
%H A053734 Yan Bo Ti, Gabriel Verret, and Lukas Zobernig, <a href="https://arxiv.org/abs/2203.08401">Abelian Varieties with p-rank Zero</a>, arXiv:2203.08401 [math.NT], 2022.
%p A053734 f := proc(n) local d,sum1; sum1 := 0; for d from 1 to n do if d mod 2 = 1 and n mod d = 0 then sum1 := sum1+(phi(d)-mobius(d))*2^(n/d); fi; od; sum1/(2*n); end;
%t A053734 Table[DivisorSum[n, Mod[#, 2] EulerPhi[#]*2^(n/#)/(2 n) &] - DivisorSum[n, Total[MoebiusMu[#]*2^(n/#)]/(2 n) &, OddQ], {n, 69}] (* _Michael De Vlieger_, Mar 26 2022 *)
%K A053734 nonn
%O A053734 1,9
%A A053734 _N. J. A. Sloane_, Mar 25 2000