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 A092965 #19 Nov 14 2014 18:28:28
%S A092965 2,3,7,13,61,241,2521,20161,72577,604801,39916801,59875201,3113510401,
%T A092965 17435658241,186810624001,10461394944001,118562476032001,
%U A092965 246245142528001,24329020081766401,304112751022080001
%N A092965 Greatest prime arising as the product of numbers chosen from among the first n numbers + 1.
%C A092965 There are a maximum of 2^n numbers which arise as the products of the subsets of the first n natural numbers. The actual number is smaller because of repetitions. Then a(n) = the greatest prime obtained on adding 1 to each of these numbers.
%C A092965 Different from A089136 (see the comments there).
%H A092965 Martin Fuller, <a href="/A092965/b092965.txt">Table of n, a(n) for n = 1..200</a>
%e A092965 a(5) = 61 = 3*4*5 + 1. 5! + 1, 4!+ 1, are composite and 2*4*5 + 1 = 41 <61, etc.
%t A092965 Do[l = Map[Times @@ #&, Subsets[Range[n]]]; Print[Max[Select[Map[ #+1&, l], PrimeQ]]], {n, 20}] (* _Ryan Propper_, Aug 13 2005 *)
%t A092965 f[n_] := Max@ Select[ Union[ Times @@@ Subsets@ Range@ n] + 1, PrimeQ]; Array[f, 20] (* _Robert G. Wilson v_, Nov 13 2014 *)
%Y A092965 Cf. A060957, A092967.
%K A092965 nonn
%O A092965 1,1
%A A092965 _Amarnath Murthy_, Mar 26 2004
%E A092965 More terms from _Ryan Propper_, Aug 13 2005