The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318466 a(n) = 2*n OR A000203(n), where OR is bitwise-or (A003986) and A000203 = sum of divisors. 11

%I

%S 3,7,6,15,14,12,14,31,31,22,30,28,30,28,30,63,50,39,54,42,42,44,62,60,

%T 63,62,62,56,62,124,62,127,114,118,118,91,110,124,126,90,122,116,126,

%U 92,94,92,126,124,123,125,110,106,126,124,110,120,114,126,126,248,126,124,126,255,214,148,198,254,234,156,206

%N a(n) = 2*n OR A000203(n), where OR is bitwise-or (A003986) and A000203 = sum of divisors.

%H Antti Karttunen, <a href="/A318466/b318466.txt">Table of n, a(n) for n = 1..65537</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>

%F a(n) = A003986(2*n, A000203(n)).

%F a(n) = A224880(n) - A318468(n).

%t Array[BitOr[2 #, DivisorSigma[1, #]] &, 71] (* _Michael De Vlieger_, Mar 30 2019 *)

%o (PARI) A318466(n) = bitor(2*n,sigma(n));

%Y Cf. A000203, A003986, A224880, A318467, A318468.

%Y Cf. also A318456.

%K nonn,base

%O 1,1

%A _Antti Karttunen_, Aug 26 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 25 19:09 EST 2020. Contains 331249 sequences. (Running on oeis4.)