The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220654 Smallest number that can be written in binary representation in exactly n ways as concatenation of palindromes. 2

%I #13 Jul 13 2013 12:04:35

%S 0,3,9,7,17,23,34,15,33,39,55,47,66,88,72,31,65,71,103,79,133,111,152,

%T 95,130,136,215,176,277,144,273,63,129,135,199,143,443,207,284,159,

%U 261,280,239,223,588,260,264,191,258,376,272,336,627,431,529,352,532

%N Smallest number that can be written in binary representation in exactly n ways as concatenation of palindromes.

%C A215244(a(n)) = n and A215244(m) < n for m < a(n).

%H Reinhard Zumkeller, <a href="/A220654/b220654.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%H <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>

%o (Haskell)

%o import Data.List (elemIndex)

%o import Data.Maybe (fromJust)

%o a220654 = fromJust . (`elemIndex` a215244_list)

%K nonn,base

%O 1,2

%A _Reinhard Zumkeller_, Dec 17 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 13:39 EDT 2024. Contains 373331 sequences. (Running on oeis4.)