[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,3
LINKS
MAPLE
b:= proc(n, i, r) option remember; `if`(i<1, 0, (t->
`if`(i<n, b(n-i, min(i, n-i), t), 0)+
`if`(i=n, t, 0)+b(n, i-1, r))(Bits[Or](i, r)))
end:
a:= n-> b(n$2, 0):
seq(a(n), n=0..45);
KEYWORD
nonn,base
AUTHOR
Alois P. Heinz, Mar 15 2019
STATUS
approved