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 A072694 #8 Nov 21 2013 12:47:50
%S A072694 4,216,24300000,18010885410000000,
%T A072694 9993825885714653185036703100000000000,
%U A072694 16151740133123735772971793020980457559217933230000000000000
%N A072694 (p(n)#)^p(n), or n-th primorial raised to n-th prime power.
%C A072694 a(7) through a(10) have 98, 133, 193 and 285 digits, respectively.
%F A072694 a(n) = (p(n)#)^p(n), where p(n) is n-th prime and # denotes primorial (A002110).
%e A072694 a(3) = 24300000 because (p(3)#)^p(3) = (5*3*2)^5 = 30^5 = 24300000.
%t A072694 With[{nn=6},First[#]^Last[#]&/@Thread[{Rest[FoldList[Times, 1, Prime[ Range[nn]]]],Prime[Range[nn]]}]] (* _Harvey P. Dale_, Mar 16 2012 *)
%o A072694 (PARI) for(n=1,6,print1((prod(k=1,n, prime(k)))^prime(n),","))
%Y A072694 Cf. A002110 (primorials), A068210 ((p(n)!)^p(n)).
%K A072694 easy,nonn
%O A072694 1,1
%A A072694 _Rick L. Shepherd_, Jul 03 2002