login
"True already", base 2, start 0: a(n) is the least integer such that the sequence up to a(n-1) written in base 2 contains floor(a(n)/2) copies of the digit a(n) % 2, with a(0) = 0.
1

%I #4 Oct 07 2013 03:24:05

%S 0,1,2,4,7,8,14,16,23,26,30,32,42,48,56,62,64,75,82,89,96,101,109,116,

%T 122,126,128,142,150,158,164,174,180,188,194,204,212,220,226,234,240,

%U 248,254,256,272,286,294,304,316,324,336,345,355,364,372,380,386

%N "True already", base 2, start 0: a(n) is the least integer such that the sequence up to a(n-1) written in base 2 contains floor(a(n)/2) copies of the digit a(n) % 2, with a(0) = 0.

%D Inspired by discussion of "True so far" from _Eric Angelini_ (A102357).

%Y Cf. A102823-A102830, A102357.

%K nonn,easy,base

%O 0,3

%A _Hugo van der Sanden_, Feb 26 2005