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 A092967 #9 Nov 18 2018 01:12:04
%S A092967 2,3,7,7,31,31,211,211,211,211,2311,2311,6007,6007,6007,6007,102103,
%T A092967 102103,3233231,3233231,3233231,3233231,17160991
%N A092967 Largest prime of the form a squarefree number + 1 where the prime divisors of the squarefree number are < n.
%C A092967 Conjecture: a(n)-1 has prime(n)-1 divisors. Subsidiary sequence: Number of primes of the form 2*p*q*r*...+1 where p, q, r, etc. are distinct odd primes < n.
%e A092967 a(13) = 6007 = 2*3*7*11*13 + 1, as 2*5*7*11*13 + 1, etc. are composite.
%t A092967 <<DiscreteMath`; <<NumberTheory`; Do[l = Select[Map[Times @@ #&, Subsets[Range[n]]], SquareFreeQ]; Print[Max[Select[Map[ #+1&, l], PrimeQ]]], {n, 1, 30}] (* _Ryan Propper_, Aug 13 2005 *)
%Y A092967 Cf. A092965, A060957.
%K A092967 nonn
%O A092967 1,1
%A A092967 _Amarnath Murthy_, Mar 26 2004
%E A092967 More terms from _Ryan Propper_, Aug 13 2005