%I
%S 1,0,3,0,3,3,4,0,3,3,3,4,5,4,4,0,3,3,3,5,3,3,4,4,5,5,4,4,5,4,4,0,3,3,
%T 3,5,3,3,5,5,3,3,3,4,7,4,4,4,5,5,5,5,7,4,4,4,5,5,4,4,5,4,4,0,3,3,3,5,
%U 3,3,5,5,3,3,3,6,5,7,5,5,3,3,3,6,3,3,4,4,7,7,4,4,8,4,4,4,5,5,5,5,5,7
%N a(n) = smallest nonnegative number that is not a substring of n in its binary representation.
%C a(A062289(n))=A261461(A062289(n)); a(A126646(n))!=A261461(A126646(n)).  _Reinhard Zumkeller_, Sep 17 2015
%H Reinhard Zumkeller, <a href="/A261922/b261922.txt">Table of n, a(n) for n = 0..10000</a>
%o (Haskell)
%o import Data.List (isInfixOf)
%o a261922 x = f a030308_tabf where
%o f (cs:css) = if isInfixOf cs (a030308_row x)
%o then f css else foldr (\d v > 2 * v + d) 0 cs
%o  _Reinhard Zumkeller_, Sep 17 2015
%Y Similar to A261461.
%Y Cf. A007088, A030308, A062289, A126646, A262281.
%K nonn,base
%O 0,3
%A _N. J. A. Sloane_, Sep 16 2015
