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 A182256 #12 Mar 27 2017 09:10:39
%S A182256 1,0,0,2,0,2,4,2,0,8,4,2,16,2,4,38,0,2,64,2,16,134,4,2,256,32,4,512,
%T A182256 16,2,1084,2,0,2054,4,158,4096,2,4,8198,256,2,16444,2,16,33272,4,2,
%U A182256 65536,128,1024,131078,16,2,262144,2078,256,524294,4,2,1052656,2,4,2097656,0,8222,4194364,2,16,8388614,17404,2,16777216,2,4,33587168,16,2174,67108924
%N A182256 a(n) = 2^n - 2*n*A000048(n).
%C A182256 a(n) = total length of all cycles (see A000048) which are strictly less than the full length of 2n.
%D A182256 R. K. Guy, Posting to Sequence Fans Mailing List, Apr 20 2012
%H A182256 Alois P. Heinz, <a href="/A182256/b182256.txt">Table of n, a(n) for n = 0..2000</a>
%p A182256 with (numtheory):
%p A182256 a:= n-> 2^n -add (mobius(d)*2^(n/d), d=select(x->is(x, odd), divisors(n))):
%p A182256 seq (a(n), n=0..80); # _Alois P. Heinz_, Apr 21 2012
%t A182256 a[n_] := 2^n - DivisorSum[n, Mod[#, 2]*MoebiusMu[#]*2^(n/#)&]; a[0] = 1;
%t A182256 Table[a[n], {n, 0, 80}] (* _Jean-François Alcover_, Mar 27 2017 *)
%Y A182256 Cf. A000048.
%K A182256 nonn
%O A182256 0,4
%A A182256 _N. J. A. Sloane_, Apr 21 2012