cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A206914 #26 Dec 09 2015 22:14:06
%S A206914 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 A206914 27,27,31,31,31,31,33,33,45,45,45,45,45,45,45,45,45,45,45,45,51,51,51,
%U A206914 51,51,51,63,63,63,63,63,63,63,63,63,63,63,63,65,65,73,73
%N A206914 Least binary palindrome >= n; the binary palindrome ceiling function.
%C A206914 For n > 0 also the least binary palindrome > n - 1;
%C A206914 a(n+1) is the least binary palindrome > n
%H A206914 Reinhard Zumkeller, <a href="/A206914/b206914.txt">Table of n, a(n) for n = 0..10000</a>
%F A206914 a(n) = A006995(A206916(n));
%F A206914 a(n) = A006995(A206916(A206913(n-1))+1);
%F A206914 a(n) = A006995(A206915(A206913(n-1))+1);
%e A206914 a(0) = 0 since 0 is the least binary palindrome >= 0;
%e A206914 a(1) = 1 since 1 is the least binary palindrome >= 1;
%e A206914 a(2) = 3 since 3 is the least binary palindrome >= 2;
%e A206914 a(5) = 5 since 5 is the least binary palindrome >= 5;
%o A206914 (Haskell)
%o A206914 a206914 n = head $ dropWhile (< n) a006995_list
%o A206914 -- _Reinhard Zumkeller_, Feb 27 2012
%Y A206914 Cf. A206915, A206920, A006995.
%Y A206914 Sequences related to palindromic floor and ceiling: A175298, A206913, A206914, A261423, A262038, and the large block of consecutive sequences beginning at A265509.
%K A206914 nonn,base
%O A206914 0,3
%A A206914 _Hieronymus Fischer_, Feb 15 2012