A206914 Least binary palindrome >= n; the binary palindrome ceiling function.

0, 1, 3, 3, 5, 5, 7, 7, 9, 9, 15, 15, 15, 15, 15, 15, 17, 17, 21, 21, 21, 21, 27, 27, 27, 27, 27, 27, 31, 31, 31, 31, 33, 33, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 51, 51, 51, 51, 51, 51, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 65, 65, 73, 73

Offset

0,3

Comments

For n > 0 also the least binary palindrome > n - 1;

a(n+1) is the least binary palindrome > n

Links

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

Formula

a(n) = A006995(A206916(n));

a(n) = A006995(A206916(A206913(n-1))+1);

a(n) = A006995(A206915(A206913(n-1))+1);

Example

a(0) = 0 since 0 is the least binary palindrome >= 0;
a(1) = 1 since 1 is the least binary palindrome >= 1;
a(2) = 3 since 3 is the least binary palindrome >= 2;
a(5) = 5 since 5 is the least binary palindrome >= 5;

Prog

(Haskell)
a206914 n = head $ dropWhile (< n) a006995_list
-- Reinhard Zumkeller, Feb 27 2012

Crossrefs

Cf. A206915, A206920, A006995.

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

Sequence in context: A237718 A245149 A339108 * A175298 A245148 A339104

Adjacent sequences: A206911 A206912 A206913 * A206915 A206916 A206917

Keyword

nonn,base

Author

Hieronymus Fischer, Feb 15 2012

Status

approved