Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Mar 11 2024 09:17:15
%S 3,6,7,14,15,21,22,28,31,46,55,57,62,63,86,92,93,94,105,110,111,124,
%T 127,154,170,171,188,189,190,201,213,215,217,231,237,248,249,250,253,
%U 254,255,310,315,316,351,357,363,369,374,376,381,382,393,430,434,447,465,469,473,483,489,494,496,497,501,506,508,511,602
%N Numbers such that 2n is equal to A318466(n), bitor(2*n,sigma(n)), where bitor is A003986.
%C Intersection with A324652 gives A000396.
%H Antti Karttunen, <a href="/A324726/b324726.txt">Table of n, a(n) for n = 1..20000</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%t Select[Range[1000], 2*# == BitOr[2*#, DivisorSigma[1, #]] &] (* _Paolo Xausa_, Mar 11 2024 *)
%o (PARI) for(n=1, oo, if(((2*n)==bitor(2*n, sigma(n))), print1(n, ", ")));
%Y Cf. A000396, A003986, A318466, A324652, A324723, A324727 (the odd terms).
%K nonn,look
%O 1,1
%A _Antti Karttunen_, Mar 15 2019