The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Oct 06 2013 23:36:38
%S 1,3,7,13,19,25,31,41,47,57,65,69,75,83,91,101,109,119,131,137,143,
%T 153,161,167,177,185,195,203,213,223,237,249,261,267,275,283,293,301,
%U 311,323,331,341,351,365,377,389,397,407,419,429,441,453,463,477,491
%N "True already", base 2, start 1: 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) = 1.
%D Inspired by discussion of "True so far" from _Eric Angelini_ (A102357).
%Y Cf. A102823-A102830, A102357.
%K nonn,easy,base
%O 0,2
%A _Hugo van der Sanden_, Feb 26 2005