This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083655 Numbers which do not appear prematurely in the binary Champernowne word (A030190). 4

%I

%S 0,1,2,4,8,10,16,32,36,64,128,136,256,512,528,1024,2048,2080,4096,

%T 8192,8256,16384,32768,32896,65536,131072,131328,262144,524288,524800,

%U 1048576,2097152,2098176,4194304,8388608,8390656,16777216,33554432

%N Numbers which do not appear prematurely in the binary Champernowne word (A030190).

%C In other words, numbers k whose binary expansion first appears in A030190 at its expected place, i.e., n appears first starting at position A296349(n). - _N. J. A. Sloane_, Dec 17 2017

%C A083653(a(n))=a(n), A083654(a(n))=1; A000079 is a subsequence.

%C a(n) are the Base 2 "Punctual Bird" numbers: write the nonnegative integers, base 2, in a string 011011100101110111.... Sequence gives numbers which do not occur in the string ahead of their natural place. - _Graeme McRae_, Aug 11 2007

%H Graeme McRae, Aug 11 2007, <a href="/A083655/b083655.txt">Table of n, a(n) for n = 0..113</a>

%F a(0)=0, a(1)=1, a(2)=2; then for n>=1, a(3n)=2^(2n), a(3n+1)=2^(2n+1), a(3n+2)=2^(2n+1)+2^n - _Graeme McRae_, Aug 11 2007

%Y Cf. A030190, A030304, A007088, A131881, A132131.

%Y For the complement, the "Early Bird" numbers, see A296365.

%K nonn,base

%O 0,3

%A _Reinhard Zumkeller_, May 01 2003

%E More terms from _Graeme McRae_, Aug 11 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 08:08 EST 2019. Contains 329968 sequences. (Running on oeis4.)