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

0, 3, 9, 7, 17, 23, 34, 15, 33, 39, 55, 47, 66, 88, 72, 31, 65, 71, 103, 79, 133, 111, 152, 95, 130, 136, 215, 176, 277, 144, 273, 63, 129, 135, 199, 143, 443, 207, 284, 159, 261, 280, 239, 223, 588, 260, 264, 191, 258, 376, 272, 336, 627, 431, 529, 352, 532

Offset

1,2

Comments

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

Links

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

Index entries for sequences related to binary expansion of n

Index entries for sequences related to palindromes

Prog

(Haskell)
import Data.List (elemIndex)
import Data.Maybe (fromJust)
a220654 = fromJust . (`elemIndex` a215244_list)

Crossrefs

Sequence in context: A294734 A214661 A178414 * A302158 A337974 A137299

Adjacent sequences: A220651 A220652 A220653 * A220655 A220656 A220657

Keyword

nonn,base

Author

Reinhard Zumkeller, Dec 17 2012

Status

approved