login
a(n) = n + (reversal of base-2 digits of n) (written in base 10).
13

%I #17 Apr 13 2021 23:25:15

%S 0,2,3,6,5,10,9,14,9,18,15,24,15,24,21,30,17,34,27,44,25,42,35,52,27,

%T 44,37,54,35,52,45,62,33,66,51,84,45,78,63,96,45,78,63,96,57,90,75,

%U 108,51,84,69,102,63,96,81,114,63,96,81,114,75,108,93,126,65,130,99,164,85

%N a(n) = n + (reversal of base-2 digits of n) (written in base 10).

%C If n has an even number of digits in base-2 then a(n) is a multiple of 3.

%H Reinhard Zumkeller, <a href="/A055944/b055944.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = n + A030101(n).

%t f[n_] := Block[{id = IntegerDigits[n, 2]}, FromDigits[id + Reverse@id, 2]]; Array[f, 69, 0] (* _Robert G. Wilson v_, Nov 07 2010 *)

%o (Haskell)

%o a055944 n = n + a030101 n -- _Reinhard Zumkeller_, Nov 14 2011

%Y Cf. A030101, A035522 (iterated), A055948.

%K base,nonn

%O 0,2

%A _Henry Bottomley_, Jul 18 2000