[go: up one dir, main page]

login

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”).

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

%I #4 Oct 06 2013 23:40:48

%S 0,1,2,3,5,6,9,11,14,17,18,24,25,27,31,38,41,42,45,50,51,54,63,68,69,

%T 72,78,81,88,94,98,104,108,110,113,116,122,125,129,132,135,143,147,

%U 150,153,159,162,174,180,188,192,198,204,207,213,216,225,231

%N "True already", base 3, start 0: a(n) is the least integer such that the sequence up to a(n-1) written in base 3 contains floor(a(n)/3) copies of the digit a(n) % 3, 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