cp's OEIS Frontend

A253443 Smallest missing number within the first n terms in A109890.

%I A253443 #12 Jan 05 2015 07:13:27
%S A253443 4,4,5,5,5,5,7,7,7,7,7,7,7,7,7,7,7,7,7,7,11,11,11,11,11,11,11,11,11,
%T A253443 11,11,11,11,11,11,11,11,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,
%U A253443 17,17,17,17,17,17,17,17,17,17,17,17,34,37,37,37,37,37
%N A253443 Smallest missing number within the first n terms in A109890.
%C A253443 A253584(n) occurs exactly A253444(n) times.
%H A253443 Reinhard Zumkeller, <a href="/A253443/b253443.txt">Table of n, a(n) for n = 4..10000</a>
%o A253443 (Haskell)
%o A253443 import Data.List (insert)
%o A253443 a253443 n = a253443_list !! (n-4)
%o A253443 a253443_list = f (4, []) 6 where
%o A253443    f (m,ys) z = g $ dropWhile (< m) $ a027750_row' z where
%o A253443      g (d:ds) | elem d ys = g ds
%o A253443               | otherwise = m : f (ins [m, m+1 ..] (insert d ys)) (z + d)
%o A253443      ins (u:us) vs'@(v:vs) = if u < v then (u, vs') else ins us vs
%o A253443 -- _Reinhard Zumkeller_, Jan 03 2015
%Y A253443 Cf. A095258, A095259, A253444 (run lengths), A253584 (range), A253415.
%K A253443 nonn
%O A253443 4,1
%A A253443 _Reinhard Zumkeller_, Jan 01 2015