[go: up one dir, main page]

login
Least binary palindrome >= n; the binary palindrome ceiling function.
75

%I #26 Dec 09 2015 22:14:06

%S 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,

%T 27,27,31,31,31,31,33,33,45,45,45,45,45,45,45,45,45,45,45,45,51,51,51,

%U 51,51,51,63,63,63,63,63,63,63,63,63,63,63,63,65,65,73,73

%N Least binary palindrome >= n; the binary palindrome ceiling function.

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

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

%H Reinhard Zumkeller, <a href="/A206914/b206914.txt">Table of n, a(n) for n = 0..10000</a>

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

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

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

%e a(0) = 0 since 0 is the least binary palindrome >= 0;

%e a(1) = 1 since 1 is the least binary palindrome >= 1;

%e a(2) = 3 since 3 is the least binary palindrome >= 2;

%e a(5) = 5 since 5 is the least binary palindrome >= 5;

%o (Haskell)

%o a206914 n = head $ dropWhile (< n) a006995_list

%o -- _Reinhard Zumkeller_, Feb 27 2012

%Y Cf. A206915, A206920, A006995.

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

%K nonn,base

%O 0,3

%A _Hieronymus Fischer_, Feb 15 2012