Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Jan 25 2013 16:25:03
%S 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,
%T 56,51,66,59,64,59,70,75,68,87,76,85,78,93,78,97,86,99,110,107,96,107,
%U 118,113,112,133,136,129,116,135,136,143,134,153,168,165,144,163,164
%N 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
%t 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}]
%K base,easy,nonn
%O 1,2
%A _Dylan Hamilton_, Oct 13 2010