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 A193869 #18 Apr 01 2019 02:27:08 %S A193869 2,15,1729,32045,60551711,85276009,52814801041129,1312422595226609, %T A193869 1130308388231798179,4182230628909121261,100166053986652515419641469, %U A193869 1898732717895963155960377,1011844196551535741726366525322443 %N A193869 Smallest product of n distinct primes of the form n*k + 1. %C A193869 Also the row products of triangle A077316. %C A193869 Note that a(3) = 1729 is known as the Hardy-Ramanujan number. %H A193869 Nathaniel Johnston, <a href="/A193869/b193869.txt">Table of n, a(n) for n = 1..100</a> %e A193869 a(1) = 2 %e A193869 a(2) = 3*5 = 15 %e A193869 a(3) = 7*13*19 = 1729 %e A193869 a(4) = 5*13*17*29 = 32045 %e A193869 a(5) = 11*31*41*61*71 = 60551711 %e A193869 a(6) = 7*13*19*31*37*43 = 85276009 %p A193869 Tj := proc(n,k) option remember: local j,p: if(k=0)then return 0:fi: for j from procname(n,k-1)+1 do if(isprime(n*j+1))then return j: fi: od: end: A193869 := proc(n) return mul(n*Tj(n,k)+1,k=1..n): end: seq(A193869(n),n=1..15); # _Nathaniel Johnston_, Sep 02 2011 %Y A193869 Cf. A001235, A077316, A092609, A121940, A154729. %K A193869 nonn %O A193869 1,1 %A A193869 _Omar E. Pol_, Sep 01 2011 %E A193869 a(7)-a(14) from _Nathaniel Johnston_, Sep 02 2011