This site is supported by donations to The OEIS Foundation.

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A222423 Sum of (n AND k) for k = 0, 1, 2, ..., n, where AND is the bitwise AND operator. 5
 0, 1, 2, 6, 4, 11, 18, 28, 8, 21, 34, 50, 60, 79, 98, 120, 16, 41, 66, 94, 116, 147, 178, 212, 216, 253, 290, 330, 364, 407, 450, 496, 32, 81, 130, 182, 228, 283, 338, 396, 424, 485, 546, 610, 668, 735, 802, 872, 816, 889, 962, 1038, 1108, 1187, 1266, 1348, 1400 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS If n = 2^x, (n AND k) = 0 for k < n, therefore a(n) = n if and only if n = 0 or n = 2^x. Row sums of A080099. - R. J. Mathar, Apr 26 2013 The associated incomplete sum_{0<=k

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