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 A117367 #12 Feb 06 2019 00:01:37
%S A117367 2,3,5,3,7,3,11,3,5,3,13,3,17,3,5,3,19,3,23,3,5,3,29,3,7,3,5,3,31,3,
%T A117367 37,3,5,3,7,3,41,3,5,3,43,3,47,3,5,3,53,3,11,3,5,3,59,3,7,3,5,3,61,3,
%U A117367 67,3,5,3,7,3,71,3,5,3,73,3,79,3,5,3,11,3,83,3,5,3,89,3,7,3,5,3,97,3,11,3,5
%N A117367 a(n) = smallest prime greater than the smallest prime dividing n.
%C A117367 All even-indexed terms are 3.
%H A117367 Michael De Vlieger, <a href="/A117367/b117367.txt">Table of n, a(n) for n = 1..10000</a>
%e A117367 5 is the smallest prime dividing 35. So a(35) is the smallest prime > 5, which is 7.
%p A117367 with(numtheory): a:=proc(n): if n=1 then 2 else nextprime(factorset(n)[1]) fi: end: seq(a(n),n=1..100); # _Emeric Deutsch_, Apr 22 2006
%t A117367 Table[NextPrime[FactorInteger[n][[1, 1]]], {n, 93}] (* _Michael De Vlieger_, Sep 16 2017 *)
%Y A117367 Cf. A117364, A117365, A117366.
%K A117367 nonn
%O A117367 1,1
%A A117367 _Leroy Quet_, Mar 10 2006
%E A117367 More terms from _Emeric Deutsch_, Apr 22 2006