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!)
 A306924 Sum over all partitions of n into distinct parts of the bitwise OR of the parts. 4
 0, 1, 2, 6, 7, 13, 20, 35, 42, 58, 75, 104, 133, 176, 233, 327, 402, 500, 616, 762, 916, 1112, 1329, 1640, 1967, 2350, 2787, 3352, 3960, 4706, 5571, 6706, 7922, 9374, 10982, 12933, 15090, 17578, 20322, 23692, 27391, 31626, 36308, 41788, 47799, 54704, 62258 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 Wikipedia, Bitwise operation Wikipedia, Commutative property Wikipedia, Identity element Wikipedia, Partition (number theory) Wikipedia, Truth table MAPLE b:= proc(n, i, r) option remember; `if`(i*(i+1)/2 `if`(i b(n\$2, 0): seq(a(n), n=0..49); CROSSREFS Cf. A000009, A066189, A306902, A306923, A306925. Sequence in context: A078471 A127406 A092310 * A087376 A199974 A176279 Adjacent sequences:  A306921 A306922 A306923 * A306925 A306926 A306927 KEYWORD nonn,base AUTHOR Alois P. Heinz, Mar 16 2019 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 23 07:07 EST 2020. Contains 331168 sequences. (Running on oeis4.)