OFFSET
1,1
COMMENTS
Read each binary representation of the primes from right to left and then OR respective digits to form the binary equivalent of each term of this sequence.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
Wikipedia, Bitwise operation
MAPLE
read("transforms") ; A175329 := proc(n) ORnos(ithprime(n), ithprime(n+1)) ; end proc: seq(A175329(n), n=1..60) ; # R. J. Mathar, Apr 15 2010
# second Maple program:
a:= n-> Bits[Or](ithprime(n), ithprime(n+1)):
seq(a(n), n=1..70); # Alois P. Heinz, Apr 16 2020
MATHEMATICA
BitOr@@#&/@Partition[Prime[Range[60]], 2, 1] (* Harvey P. Dale, Mar 01 2024 *)
PROG
(PARI) a(n) = bitor(prime(n), prime(n+1)); \\ Michel Marcus, Apr 20 2020
CROSSREFS
KEYWORD
base,nonn,easy
AUTHOR
Leroy Quet, Apr 07 2010
EXTENSIONS
More terms from R. J. Mathar, Apr 15 2010
STATUS
approved