cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A035526 Reverse and add (in binary).

This page as a plain text file.
%I A035526 #17 Jan 11 2021 03:49:06
%S A035526 1,10,11,110,1001,10010,11011,110110,1010001,10010110,11111111,
%T A035526 111111110,1011111101,10111111010,100011110111,1011111101000,
%U A035526 1101011100101,10111111010000,11001011001101,101111110100000
%N A035526 Reverse and add (in binary).
%C A035526 First 4 members are the divisors of 6 (the first perfect number), written in base 2 (see A135652, A135653, A135654, A135655). - _Omar E. Pol_, May 04 2008
%H A035526 Reinhard Zumkeller, <a href="/A035526/b035526.txt">Table of n, a(n) for n = 0..1000</a>
%F A035526 a(n) = A007088(A035522(n)). - _Reinhard Zumkeller_, Jan 02 2015
%e A035526 110 + 011 = 1001.
%o A035526 (Haskell)
%o A035526 a035526 = a007088 . a035522  -- _Reinhard Zumkeller_, Jan 02 2015
%o A035526 (Python)
%o A035526 from itertools import accumulate, repeat
%o A035526 def iterate(n, _): b = str(n); return int(bin(int(b, 2)+int(b[::-1], 2))[2:])
%o A035526 def aupto(nn): return list(accumulate(repeat(1, nn), iterate))
%o A035526 print(aupto(20)) # _Michael S. Branicky_, Jan 10 2021
%Y A035526 Cf. A035522 for same sequence but written in base 10.
%Y A035526 Cf. A007088.
%K A035526 nonn,base,easy,nice
%O A035526 0,2
%A A035526 _N. J. A. Sloane_, E. M. Rains