

A181341


Divide the left and right binary concatenations of 1 to n into sections alternating between being composed entirely of consecutive digits identical in both concatenations and consecutive digits different in both concatenations, then count the sections in one of the concatenations


0



1, 2, 3, 4, 5, 8, 11, 14, 13, 16, 15, 20, 15, 26, 23, 30, 27, 34, 33, 42, 39, 46, 43, 54, 55, 56, 51, 66, 59, 64, 59, 70, 75, 68, 87, 76, 85, 78, 93, 78, 97, 86, 99, 110, 107, 96, 107, 118, 113, 112, 133, 136, 129, 116, 135, 136, 143, 134, 153, 168, 165, 144, 163, 164
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Table of n, a(n) for n=1..64.


MATHEMATICA

l = {}; r = {}; Table[d = IntegerDigits[x, 2]; l = Flatten[{l, d}]; r = Flatten[{d, r}]; Length[Split[ EvenQ[l + r]]], {x, 1, NUMBER_OF_TERMS_HERE}]


CROSSREFS

Sequence in context: A302591 A269571 A281493 * A174181 A298424 A008812
Adjacent sequences: A181338 A181339 A181340 * A181342 A181343 A181344


KEYWORD

base,easy,nonn


AUTHOR

Dylan Hamilton, Oct 13 2010


STATUS

approved



