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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318463 a(n) = Sum_{d|n, d < n/d} (d AND n/d), where AND is bitwise-and (A004198). 5
 0, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 2, 2, 0, 1, 2, 1, 6, 4, 2, 1, 4, 1, 0, 2, 6, 1, 8, 1, 0, 4, 0, 6, 2, 1, 2, 2, 0, 1, 8, 1, 2, 5, 2, 1, 4, 1, 0, 2, 6, 1, 4, 2, 4, 4, 0, 1, 12, 1, 2, 3, 0, 6, 4, 1, 2, 4, 8, 1, 12, 1, 0, 7, 2, 4, 8, 1, 12, 4, 0, 1, 16, 2, 2, 2, 12, 1, 16, 6, 6, 4, 2, 2, 8, 1, 6, 11, 6, 1, 4, 1, 8, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = A000203(n) - A318461(n) = (A000203(n)-A318462(n))/2. PROG A318463(n) = { my(ands=0); fordiv(n, d, if(d<(n/d), ands += bitand(d, n/d))); (ands); }; CROSSREFS Cf. A000203, A004198, A318458, A318460, A318461, A318462. Sequence in context: A097468 A283144 A098381 * A030372 A065363 A119995 Adjacent sequences:  A318460 A318461 A318462 * A318464 A318465 A318466 KEYWORD nonn,base AUTHOR Antti Karttunen, Aug 28 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 21 16:47 EST 2020. Contains 331114 sequences. (Running on oeis4.)