cp's OEIS Frontend

A251549 a(n) = smallest odd number not in {A098550(1), A098550(2), ..., A098550(n)}.

%I A251549 #18 Aug 02 2018 07:55:41
%S A251549 3,3,5,5,5,5,5,5,7,7,7,7,7,7,11,11,11,11,11,11,11,13,17,17,17,17,17,
%T A251549 17,17,19,19,19,19,19,19,19,19,19,19,19,19,19,23,23,23,23,23,23,23,23,
%U A251549 29,29,29,29,29,29,29,29,29
%N A251549 a(n) = smallest odd number not in {A098550(1), A098550(2), ..., A098550(n)}.
%C A251549 A251416(n) = Min{A251546(n), a(n)}. - _Reinhard Zumkeller_, Dec 19 2014
%H A251549 Chai Wah Wu, <a href="/A251549/b251549.txt">Table of n, a(n) for n = 1..10000</a>
%t A251549 terms = 100;
%t A251549 f[lst_List] := Block[{k=4}, While[GCD[lst[[-2]], k] == 1 || GCD[lst[[-1]], k] > 1 || MemberQ[lst, k], k++]; Append[lst, k]];
%t A251549 A098550 = Nest[f, {1, 2, 3}, terms-3];
%t A251549 a[1] = 3;
%t A251549 a[n_] := a[n] = For[k = a[n-1], True, k = k+2, If[FreeQ[A098550[[1 ;; n]], k], Return[k]]];
%t A251549 Array[a, terms] (* _Jean-François Alcover_, Aug 02 2018, after _Robert G. Wilson v_ *)
%o A251549 (Haskell)
%o A251549 import Data.List ((\\))
%o A251549 a251549 n = head $ [1, 3 ..] \\ filter odd (take n a098550_list)
%o A251549 -- _Reinhard Zumkeller_, Dec 19 2014
%Y A251549 Cf. A098550, A247253, A251416, A251417, A251546-A251552.
%K A251549 nonn
%O A251549 1,1
%A A251549 _N. J. A. Sloane_, Dec 18 2014