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 A268395 #17 Feb 13 2016 03:49:42
%S A268395 0,0,0,1,1,3,4,4,4,5,7,7,8,8,8,11,11,15,16,16,18,18,18,19,20,20,20,22,
%T A268395 22,23,26,26,26,27,31,31,32,32,32,34,36,36,36,37,37,40,41,41,42,42,42,
%U A268395 47,47,48,50,50,50,52,53,53,56,56,56,57,57,59,60,60,64,64,64,65,66,66,66,69,69,70,72,72,74,74,74,75,75,81
%N A268395 Partial sums of A268389.
%H A268395 Antti Karttunen, <a href="/A268395/b268395.txt">Table of n, a(n) for n = 0..65537</a>
%F A268395 a(0) = 0, for n >= 1, a(n) = A268389(n) + a(n-1).
%F A268395 Other identities. For all n >= 0:
%F A268395 a(n) = A268389(A048631(n)).
%F A268395 a(n) = n - A268672(n).
%t A268395 f[n_] := Which[n == 1, 0, OddQ@ #, 0, EvenQ@ #, 1 + f[#/2]] &@ Fold[BitXor, n, Quotient[n, 2^Range[BitLength@ n - 1]]]; Accumulate@ Array[f, {85}] (* _Michael De Vlieger_, Feb 12 2016, after _Jan Mangaldan_ at A006068 *)
%o A268395 (Scheme, with memoization-macro definec)
%o A268395 (definec (A268395 n) (if (zero? n) n (+ (A268389 n) (A268395 (- n 1)))))
%Y A268395 Cf. A048631, A268389, A268672.
%Y A268395 Cf. A268678 (with duplicates removed), A268677 (numbers that do not occur here).
%Y A268395 Cf. A268708, A268709, A268710.
%Y A268395 Cf. also A054861.
%K A268395 nonn
%O A268395 0,6
%A A268395 _Antti Karttunen_, Feb 10 2016