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.

1, 11, 101, 111, 1001, 1001, 1001, 1111, 10001, 10001, 10101, 10101, 10001, 11011, 10101, 11111, 100001, 100001, 100001, 100001, 100001, 100001, 101101, 101101, 100001, 110011, 100001, 110011, 100001, 110011, 101101, 111111, 1000001, 1000001, 1000001, 1000001, 1001001, 1001001, 1001001, 1001001, 1000001, 1000001

Offset

0,2

Comments

a(n) = A007088(A265509(n)). - Reinhard Zumkeller, Dec 11 2015

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..8191

Prog

(Haskell)
a265510 = a007088 . a265509  -- Reinhard Zumkeller, Dec 11 2015

Crossrefs

Sequences related to palindromic floor and ceiling: A175298, A206913, A206914, A261423, A262038, and the large block of consecutive sequences beginning at A265509.

Cf. A007088.

Sequence in context: A208259 A043036 A072001 * A265528 A099821 A193415

Adjacent sequences: A265507 A265508 A265509 * A265511 A265512 A265513

Keyword

nonn,base

Author

N. J. A. Sloane, Dec 09 2015

Status

approved