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.
%I A264618 #23 Dec 03 2015 13:17:43 %S A264618 0,5,17,27,65,85,99,119,257,297,325,365,387,427,455,495,1025,1105, %T A264618 1161,1241,1285,1365,1421,1501,1539,1619,1675,1755,1799,1879,1935, %U A264618 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 %N A264618 Working in binary, write n followed by 0 then n-reversed (including leading zeros); show result in base 10. %C A264618 a(n) = A264619(n) - A062383(n); n>0: A070939(a(n)) = 2*A070939(n)+1; A000120(a(n)) = 2*A000120(n); n>0: A023416(a(n)) = 2*A023416(n)+1. - _Reinhard Zumkeller_, Dec 01 2015 %H A264618 N. J. A. Sloane, <a href="/A264618/b264618.txt">Table of n, a(n) for n = 0..32767</a> %e A264618 0 -> 000 = 0, %e A264618 1 -> 101 = 5, %e A264618 10 -> 10001 = 17, %e A264618 11 -> 11011 = 27, %e A264618 100 -> 1000001 = 65, %e A264618 ... %t A264618 A264618[n_]:=FromDigits[Join[#, {0}, Reverse[#]], 2] &@IntegerDigits[n, 2] (* _JungHwan Min_, Dec 01 2015 *) %o A264618 (Haskell) %o A264618 a264618 n = foldr (\b v -> 2 * v + b) 0 $ (reverse bs ++ (0 : bs)) %o A264618 where bs = map fromIntegral $ a030308_row n %o A264618 -- _Reinhard Zumkeller_, Dec 01 2015 %Y A264618 Cf. A006995, A048701 (n followed by n-reversed), A264619. %Y A264618 First differences: A265028. %Y A264618 Cf. A007088, A030308, A000120, A023416, A062383, A070939. %K A264618 nonn,base %O A264618 0,2 %A A264618 _N. J. A. Sloane_, Nov 30 2015