OFFSET
0,3
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Reinhard Zumkeller, Logical Convolutions
MAPLE
A142151 := n -> n + Bits:-Nor(n, n+1):
seq(A142151(n), n=0..69); # Peter Luschny, Sep 26 2019
PROG
(Haskell)
import Data.Bits (xor, (.|.))
a142151 :: Integer -> Integer
a142151 = foldl (.|.) 0 . zipWith xor [0..] . reverse . enumFromTo 1
-- Reinhard Zumkeller, Mar 31 2015
(Julia)
using IntegerSequences
A142151List(len) = [Bits("CIMP", n, n+1) for n in 0:len]
println(A142151List(69)) # Peter Luschny, Sep 25 2021
(Python)
from functools import reduce
from operator import or_
def A142151(n): return 0 if n == 0 else reduce(or_, (k^n-k for k in range(n+1))) if n % 2 else (1 << n.bit_length()-1)-1 <<1 # Chai Wah Wu, Jun 30 2022
CROSSREFS
AUTHOR
Reinhard Zumkeller, Jul 15 2008
STATUS
approved