cp's OEIS Frontend

A083654 Consider the binary Champernowne sequence (A030190): number of successive numbers to be concatenated beginning with A083653(n) such that in binary representation n is contained.

%I A083654 #5 Mar 30 2012 18:50:34
%S A083654 1,1,1,2,1,2,2,2,1,2,1,2,2,3,2,2,1,2,2,2,2,2,2,3,2,3,2,3,2,3,2,2,1,2,
%T A083654 2,2,1,2,2,2,2,2,2,2,2,2,3,3,2,3,3,2,2,3,2,4,2,3,2,3,2,3,2,2,1,2,2,2,
%U A083654 2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,3,3,3,3,2,3,3,2,2,3,2,2,2
%N A083654 Consider the binary Champernowne sequence (A030190): number of successive numbers to be concatenated beginning with A083653(n) such that in binary representation n is contained.
%C A083654 a(2^k)=1, see A083655 for all numbers m with a(m)=1;
%e A083654 n=24: '11000'=24 is a suffix of the concatenation of the first 8 numbers: '0'1'10'11'100'101'110'111'1000', therefore a(24)=2 and A083653(24)=7.
%Y A083654 Cf. A030304, A007088.
%K A083654 nonn,base
%O A083654 0,4
%A A083654 _Reinhard Zumkeller_, May 01 2003