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 A318462 #7 Aug 28 2018 16:00:07
%S A318462 1,3,2,7,4,8,6,15,11,18,10,24,12,20,20,31,16,35,18,30,24,32,22,52,29,
%T A318462 42,36,44,28,56,30,63,40,54,36,87,36,56,52,90,40,80,42,80,68,68,46,
%U A318462 116,55,93,68,86,52,112,68,112,72,90,58,144,60,92,98,127,72,136,66,122,88,128,70,171,72,114,110,136,88,152,78
%N A318462 a(n) = Sum_{d|n, d < n/d} (d XOR n/d) + {square root of n when n is a square}.
%H A318462 Antti Karttunen, <a href="/A318462/b318462.txt">Table of n, a(n) for n = 1..16384</a>
%H A318462 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A318462 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A318462 a(n) = A318460(n) + A037213(n) = A000203(n) - 2*A318463(n).
%o A318462 (PARI) A318462(n) = { my(xors=0); fordiv(n,d, if(d<(n/d), xors += bitxor(d,n/d), if(d==(n/d), xors += d))); (xors); };
%Y A318462 Cf. A000203, A003987, A037213, A318457, A318460, A318461, A318463.
%K A318462 nonn,base
%O A318462 1,2
%A A318462 _Antti Karttunen_, Aug 28 2018