A264618 Working in binary, write n followed by 0 then n-reversed (including leading zeros); show result in base 10.
0, 5, 17, 27, 65, 85, 99, 119, 257, 297, 325, 365, 387, 427, 455, 495, 1025, 1105, 1161, 1241, 1285, 1365, 1421, 1501, 1539, 1619, 1675, 1755, 1799, 1879, 1935, 2015, 4097, 4257, 4369, 4529, 4617, 4777, 4889, 5049, 5125, 5285, 5397, 5557, 5645, 5805, 5917, 6077, 6147, 6307, 6419, 6579, 6667, 6827, 6939, 7099, 7175
Offset: 0
Examples
0 -> 000 = 0, 1 -> 101 = 5, 10 -> 10001 = 17, 11 -> 11011 = 27, 100 -> 1000001 = 65, ...
Links
- N. J. A. Sloane, Table of n, a(n) for n = 0..32767
Crossrefs
Programs
-
Haskell
a264618 n = foldr (\b v -> 2 * v + b) 0 $ (reverse bs ++ (0 : bs)) where bs = map fromIntegral $ a030308_row n -- Reinhard Zumkeller, Dec 01 2015
-
Mathematica
A264618[n_]:=FromDigits[Join[#, {0}, Reverse[#]], 2] &@IntegerDigits[n, 2] (* JungHwan Min, Dec 01 2015 *)
Comments