A241426 Value of concatenation of all suffixes of binary representation of n.

0, 1, 4, 7, 32, 43, 52, 63, 512, 587, 660, 735, 800, 875, 948, 1023, 16384, 17483, 18580, 19679, 20768, 21867, 22964, 24063, 25088, 26187, 27284, 28383, 29472, 30571, 31668, 32767, 1048576, 1082443, 1116308, 1150175, 1184032, 1217899, 1251764, 1285631

Offset

0,3

Comments

a(2^n) = 2^(n*(n+3)/2).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..8191

Index entries for sequences related to binary expansion of n

Example

.   n | A007088(n) |     suffixes     | A007088(a(n)) | a(n)
. ----+------------+------------------+---------------+-----
.   2 |         10 | 10, 0            |           100 |    4
.   3 |         11 | 11, 1            |           111 |    7
.   4 |        100 | 100, 00, 0       |        100000 |   32
.   5 |        101 | 101, 01, 1       |        101011 |   43
.   6 |        110 | 110, 10, 0       |        110100 |   52
.   7 |        111 | 111, 11, 1       |        111111 |   63
.   8 |       1000 | 1000, 000, 00, 0 |    1000000000 |  512
.   9 |       1001 | 1001, 001, 01, 1 |    1001001011 |  587
.  10 |       1010 | 1010, 010, 10, 0 |    1010010100 |  660
.  11 |       1011 | 1011, 011, 11, 1 |    1011011111 |  735
.  12 |       1100 | 1100, 100, 00, 0 |    1100100000 |  800 .

Prog

(Haskell)
import Data.List (inits, unfoldr); import Data.Tuple (swap)
a241426 = foldr (\b v -> 2 * v + b) 0 . concat . inits .
          unfoldr (\x -> if x == 0 then Nothing
                                   else Just $ swap $ divMod x 2)

Crossrefs

Cf. A030308, A007088, A000079, A000096.

Sequence in context: A218959 A283332 A000289 * A271676 A149089 A004031

Adjacent sequences: A241423 A241424 A241425 * A241427 A241428 A241429

Keyword

nonn,base

Author

Reinhard Zumkeller, Aug 08 2014

Status

approved