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 A220654 #13 Jul 13 2013 12:04:35 %S A220654 0,3,9,7,17,23,34,15,33,39,55,47,66,88,72,31,65,71,103,79,133,111,152, %T A220654 95,130,136,215,176,277,144,273,63,129,135,199,143,443,207,284,159, %U A220654 261,280,239,223,588,260,264,191,258,376,272,336,627,431,529,352,532 %N A220654 Smallest number that can be written in binary representation in exactly n ways as concatenation of palindromes. %C A220654 A215244(a(n)) = n and A215244(m) < n for m < a(n). %H A220654 Reinhard Zumkeller, <a href="/A220654/b220654.txt">Table of n, a(n) for n = 1..10000</a> %H A220654 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A220654 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a> %o A220654 (Haskell) %o A220654 import Data.List (elemIndex) %o A220654 import Data.Maybe (fromJust) %o A220654 a220654 = fromJust . (`elemIndex` a215244_list) %K A220654 nonn,base %O A220654 1,2 %A A220654 _Reinhard Zumkeller_, Dec 17 2012