

A175046


Write n in binary, then increase each run of 0's by one 0, and increase each run of 1's by one 1. a(n) is the decimal equivalent of the result.


6



3, 12, 7, 24, 51, 28, 15, 48, 99, 204, 103, 56, 115, 60, 31, 96, 195, 396, 199, 408, 819, 412, 207, 112, 227, 460, 231, 120, 243, 124, 63, 192, 387, 780, 391, 792, 1587, 796, 399, 816, 1635, 3276, 1639, 824, 1651, 828, 415, 224, 451, 908, 455, 920, 1843, 924
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS

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


EXAMPLE

6 in binary is 110. Increase each run by one digit to get 11100, which is 28 in decimal. So a(6) = 28.


PROG

(Haskell)
import Data.List (group)
a175046 = foldr (\b v > 2 * v + b) 0 .
concatMap (\bs@(b:_) > b : bs) . group . a030308_row
 Reinhard Zumkeller, Jul 05 2013


CROSSREFS

Cf. A175047, A175048.
Cf. A030308, A007088.
Sequence in context: A085296 A214401 A009781 * A093855 A013188 A234947
Adjacent sequences: A175043 A175044 A175045 * A175047 A175048 A175049


KEYWORD

base,nonn


AUTHOR

Leroy Quet, Dec 02 2009


EXTENSIONS

Extended by Ray Chandler, Dec 18 2009


STATUS

approved



