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!)
 A306902 Sum over all partitions of n of the bitwise OR of the parts. 6
 0, 1, 3, 7, 13, 23, 40, 67, 103, 156, 231, 340, 486, 689, 964, 1352, 1845, 2507, 3363, 4500, 5937, 7814, 10174, 13247, 17064, 21930, 27957, 35616, 45009, 56805, 71252, 89320, 111282, 138479, 171421, 212021, 260974, 320837, 392753, 480395, 585239, 712163, 863536 (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<1, 0, (t->       `if`(i b(n\$2, 0): seq(a(n), n=0..45); CROSSREFS Cf. A006906, A066186, A306884, A306895, A306901, A306903, A306924. Sequence in context: A155339 A122886 A154691 * A227121 A078447 A066624 Adjacent sequences:  A306899 A306900 A306901 * A306903 A306904 A306905 KEYWORD nonn,base AUTHOR Alois P. Heinz, Mar 15 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 April 8 08:54 EDT 2020. Contains 333313 sequences. (Running on oeis4.)