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”).

A256078
Write n in binary, exchange digits '0' <-> '1'.
10
1, 0, 1, 0, 11, 10, 1, 0, 111, 110, 101, 100, 11, 10, 1, 0, 1111, 1110, 1101, 1100, 1011, 1010, 1001, 1000, 111, 110, 101, 100, 11, 10, 1, 0, 11111, 11110, 11101, 11100, 11011, 11010, 11001, 11000, 10111, 10110, 10101, 10100, 10011, 10010, 10001, 10000
OFFSET
0,5
COMMENTS
Binary representation of A035327.
A base-2 analog of A048379.
LINKS
MAPLE
f:= proc(n) local L, i;
L:= convert(n, base, 2);
add((1-L[i])*10^(i-1), i=1..nops(L))
end proc:
map(f, [$0..100]); # Robert Israel, Sep 17 2024
MATHEMATICA
Table[FromDigits[IntegerDigits[n, 2] /. {0 -> 1, 1 -> 0}], {n, 0, 47}] (* or *)
Table[FromDigits@ IntegerDigits[BitXor[n, 2^IntegerPart[Log[2, n] + 1] - 1], 2], {n, 0, 47}] (* Michael De Vlieger, Mar 22 2015, the latter based on Alonso del Arte at A035327 *)
PROG
(PARI) A256078(n)=!n+eval(Strchr(apply(d->49-d, binary(n))))
(Python)
def a(n): return int(bin(1 if n==0 else n^((1 << n.bit_length())-1))[2:])
print([a(n) for n in range(48)]) # Michael S. Branicky, Dec 21 2022
CROSSREFS
Sequence in context: A038323 A121154 A326587 * A078200 A105034 A324153
KEYWORD
nonn,base,easy
AUTHOR
M. F. Hasler, Mar 22 2015
STATUS
approved