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 A290393 #15 Aug 08 2017 22:07:28
%S A290393 1844,1892,2512,3700,4702,5476,5534,7364,7784,7876,8068,8080,8440,
%T A290393 8596,8632,8764,9100,9308,9334,9404,10000,10108,10120,10348,10456,
%U A290393 10480,10744,10844,11024,11504,11588,12604,12722,13714,14576,15812,16150,16622,17300,17820,17950,18316,18622,21100,21400,21860
%N A290393 Numbers that are not the difference of two binary palindromes (A006995).
%C A290393 Not currently known to be an infinite sequence.
%C A290393 Based on b-file of _Giovanni Resta_, the smallest value of a(n) such that a(n+1) - a(n) = 2 is 76156. - _Altug Alkan_, Aug 08 2017
%H A290393 Giovanni Resta, <a href="/A290393/b290393.txt">Table of n, a(n) for n = 1..342</a> (terms <= 10^5)
%t A290393 g[w_] := FromDigits[Join @@ w, 2]; bp[1] = {1}; bp[n_] := Block[{b, r, h = Floor[n/2]}, Sort@ Flatten@ Table[b = IntegerDigits[k, 2, h]; r = Reverse@b; If[OddQ@n, g /@ {{b, {0}, r}, {b, {1}, r}}, g@{b, r}], {k, 2^h/2, 2^h - 1}]]; pp = Sort@Flatten[Table[bp[h], {h, 32}]]; T = Range[50000] * 0; i = 0; While[i < Length[pp] - 1, i++; j = i+1; While[j <= Length[pp] && (d = pp[[j]] - pp[[i]]) <= 10^5, T[[d/2]] = 1; j++]]; 2 Flatten[Position[T, 0]] (* _Giovanni Resta_, Aug 08 2017 *)
%Y A290393 Cf. A006995.
%K A290393 nonn,base
%O A290393 1,1
%A A290393 _Jeffrey Shallit_, Jul 29 2017