OFFSET
1,1
COMMENTS
Bradley Klee conjectures that after a(30)=18, all further terms are primes, that every prime appears, and the primes appear in increasing order.
REFERENCES
Bradley Klee, Posting to Sequence Fans Mailing List, Dec 03 2014
LINKS
N. J. A. Sloane and Reinhard Zumkeller, Table of n, a(n) for n = 1..100000 (first 1000 terms from N. J. A. Sloane)
FORMULA
MAPLE
# This produces the first 100 terms. Uses b1 = list of terms in A098550, from b-file
b2:={$3..5000}:
b3:=[2]:
for i from 2 to 100 do
b2:=remove('x->x=b1[i]', b2):
b3:=[op(b3), b2[1]];
od:
b3;
MATHEMATICA
terms = 100;
f[lst_List] := Block[{k = 4}, While[GCD[lst[[-2]], k] == 1 || GCD[lst[[-1]], k] > 1 || MemberQ[lst, k], k++]; Append[lst, k]];
A098550 = Nest[f, {1, 2, 3}, terms-3];
a[1] = 2;
a[n_] := a[n] = For[k = a[n - 1], True, k++, If[FreeQ[A098550[[1 ;; n]], k], Return[k]]];
Array[a, terms] (* Jean-François Alcover, Aug 01 2018, after Robert G. Wilson v *)
PROG
(Haskell)
import Data.List (delete)
a251416 n = a251416_list !! (n-1)
a251416_list = 2 : 3 : f 2 3 [4..] where
f u v ws = h ws where
h (x:xs) = if gcd x u > 1 && gcd x v == 1
then (head ws) : f v x (delete x ws) else h xs
-- Reinhard Zumkeller, Dec 05 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 03 2014
STATUS
approved