|
|
A035526
|
|
Reverse and add (in binary).
|
|
2
|
|
|
1, 10, 11, 110, 1001, 10010, 11011, 110110, 1010001, 10010110, 11111111, 111111110, 1011111101, 10111111010, 100011110111, 1011111101000, 1101011100101, 10111111010000, 11001011001101, 101111110100000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
110 + 011 = 1001.
|
|
PROG
|
(Haskell)
(Python)
from itertools import accumulate, repeat
def iterate(n, _): b = str(n); return int(bin(int(b, 2)+int(b[::-1], 2))[2:])
def aupto(nn): return list(accumulate(repeat(1, nn), iterate))
|
|
CROSSREFS
|
Cf. A035522 for same sequence but written in base 10.
|
|
KEYWORD
|
nonn,base,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|