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.

A324659 a(n) = (1/2)*A318468(n), where A318468(n) is bitwise-AND of 2*n and sigma(n).

This page as a plain text file.
%I A324659 #12 Mar 12 2024 05:01:33
%S A324659 0,0,2,0,1,6,4,0,0,8,2,12,5,12,12,0,1,18,2,20,16,18,4,24,9,16,16,28,
%T A324659 13,4,16,0,0,2,0,36,1,6,4,40,1,32,2,40,37,36,8,48,16,34,32,48,17,52,
%U A324659 36,56,40,40,26,20,29,48,52,0,0,64,2,4,0,64,4,64,1,8,10,68,0,68,8,80,16,18,2,80,20,66,20,88,9,80
%N A324659 a(n) = (1/2)*A318468(n), where A318468(n) is bitwise-AND of 2*n and sigma(n).
%H A324659 Antti Karttunen, <a href="/A324659/b324659.txt">Table of n, a(n) for n = 1..16384</a>
%H A324659 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A324659 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A324659 a(n) = A318468(n)/2.
%F A324659 a(n) = n - A324658(n).
%t A324659 Array[BitAnd[2*#, DivisorSigma[1, #]]/2 &, 100] (* _Paolo Xausa_, Mar 11 2024 *)
%o A324659 (PARI) A324659(n) = (bitand(2*n,sigma(n))/2);
%Y A324659 Cf. A000203, A004198, A318458, A318468, A324648, A324658.
%Y A324659 Cf. A324652 (fixed points).
%K A324659 nonn,look
%O A324659 1,3
%A A324659 _Antti Karttunen_, Mar 14 2019