This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A262231 #13 Apr 17 2016 12:24:25 %S A262231 2,4,7,11,13,17,19,22,26,29,31,34,37,41,43,47,49,52,58,61,67,71,73,77, %T A262231 79,82,86,89,91,94,97,101,103,107,109,113,116,119,121,127,131,133,137, %U A262231 139,142,146,149,151,157,163,167,169,172,178,181,187,191 %N A262231 First term is 2; each subsequent term is the least number greater than the previous term but not a multiple of the successor of any previous term. %C A262231 If the twin prime conjecture is true, this sequence has infinitely many pairs of terms with difference at most 3. %H A262231 Charles R Greathouse IV, <a href="/A262231/b262231.txt">Table of n, a(n) for n = 1..10000</a> %F A262231 a(n) = A100464(n) - 1. %e A262231 25 is excluded because it is a multiple of 4+1; 26 is not a multiple of 3,5,8,...,23 so it remains in the sequence. %o A262231 (PARI) has(n)=fordiv(n,d, if(mapisdefined(m, d-1), return(0))); 1 %o A262231 first(n)=local(m=Map(Mat([2,0]))); my(t=3); while(#m<n, while(!has(t++),); mapput(m,t,0)); Mat(m)[,1]~ \\ _Charles R Greathouse IV_, Sep 16 2015 %Y A262231 Cf. A100464. %K A262231 nonn %O A262231 1,1 %A A262231 _Drake Thomas_, Sep 15 2015