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 #10 May 18 2019 15:43:58
%S 1,2,3,5,7,9,12,15,20,25,30,35,40,45,50,57,64,71,81,91,101,114,127,
%T 140,153,166,180,194,208,224,240,256,272,289,306,323,340,357,376,397,
%U 418,439,461,483,505,527,552,577,602,627,656,685,714,743,776,809,842
%N Number of distinct numbers that are contained in the length n+1 prefix of the binary Champernowne word.
%H Rémy Sigrist, <a href="/A133231/b133231.txt">Table of n, a(n) for n = 0..10000</a>
%H Rémy Sigrist, <a href="/A133231/a133231.pl.txt">Perl program A133231</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%e Champernowne word = '01101110 01011....', see A030190:
%e a(5) = #{0, 1, 10, 11, 101, 110, 1011, 1101, 11011} = 9;
%e a(6) = a(5) + #{111, 10111, 110111} = 9 + 3 = 12;
%e a(7) = a(6) + #{1110, 101110, 1101110} = 12 + 3 = 15.
%o (Perl) See Links section.
%Y Cf. A030190, A055143.
%K nonn,base
%O 0,2
%A _Reinhard Zumkeller_, Jan 15 2008
%E More terms from _Rémy Sigrist_, May 18 2019