cp's OEIS Frontend

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.

A318461 a(n) = Sum_{d|n, d <= n/d} (d OR n/d), where OR is bitwise-or (A003986).

This page as a plain text file.
%I A318461 #8 Aug 28 2018 16:00:13
%S A318461 1,3,3,7,5,10,7,15,12,18,11,26,13,22,22,31,17,37,19,36,28,34,23,56,30,
%T A318461 42,38,50,29,64,31,63,44,54,42,89,37,58,54,90,41,88,43,82,73,70,47,
%U A318461 120,56,93,70,92,53,116,70,116,76,90,59,156,61,94,101,127,78,140,67,124,92,136,71,183,73,114,117,138,92,160,79
%N A318461 a(n) = Sum_{d|n, d <= n/d} (d OR n/d), where OR is bitwise-or (A003986).
%H A318461 Antti Karttunen, <a href="/A318461/b318461.txt">Table of n, a(n) for n = 1..16384</a>
%H A318461 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A318461 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A318461 a(n) = A000203(n) - A318463(n).
%o A318461 (PARI) A318461(n) = { my(ors=0); fordiv(n,d,if(d<=(n/d), ors += bitor(d,n/d))); (ors); };
%Y A318461 Cf. A000203, A003986, A318456, A318462, A318463.
%K A318461 nonn,base
%O A318461 1,2
%A A318461 _Antti Karttunen_, Aug 28 2018