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 A265510 #11 Dec 11 2015 15:21:43 %S A265510 1,11,101,111,1001,1001,1001,1111,10001,10001,10101,10101,10001,11011, %T A265510 10101,11111,100001,100001,100001,100001,100001,100001,101101,101101, %U A265510 100001,110011,100001,110011,100001,110011,101101,111111,1000001,1000001,1000001,1000001,1001001,1001001,1001001,1001001,1000001,1000001 %N A265510 a(n) = largest base-2 palindrome m <= 2n+1 such that every base-2 digit of m is <= the corresponding digit of 2n+1; m is written in base 2. %C A265510 a(n) = A007088(A265509(n)). - _Reinhard Zumkeller_, Dec 11 2015 %H A265510 Reinhard Zumkeller, <a href="/A265510/b265510.txt">Table of n, a(n) for n = 0..8191</a> %o A265510 (Haskell) %o A265510 a265510 = a007088 . a265509 -- _Reinhard Zumkeller_, Dec 11 2015 %Y A265510 Sequences related to palindromic floor and ceiling: A175298, A206913, A206914, A261423, A262038, and the large block of consecutive sequences beginning at A265509. %Y A265510 Cf. A007088. %K A265510 nonn,base %O A265510 0,2 %A A265510 _N. J. A. Sloane_, Dec 09 2015