login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
3, 7, 6, 15, 14, 12, 14, 31, 31, 22, 30, 28, 30, 28, 30, 63, 50, 39, 54, 42, 42, 44, 62, 60, 63, 62, 62, 56, 62, 124, 62, 127, 114, 118, 118, 91, 110, 124, 126, 90, 122, 116, 126, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A003986(2*n, A000203(n)).
a(n) = A224880(n) - A318468(n).
MATHEMATICA
Array[BitOr[2 #, DivisorSigma[1, #]] &, 71] (* Michael De Vlieger, Mar 30 2019 *)
PROG
(PARI) A318466(n) = bitor(2*n, sigma(n));
(Python)
from sympy import divisor_sigma
def A318466(n): return (n<<1)|int(divisor_sigma(n)) # Chai Wah Wu, Jul 10 2022
CROSSREFS
Cf. also A318456.
Sequence in context: A109635 A095360 A175142 * A324819 A217112 A241016
KEYWORD
nonn,look,base
AUTHOR
Antti Karttunen, Aug 26 2018
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)