cp's OEIS Frontend

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.

A072694 (p(n)#)^p(n), or n-th primorial raised to n-th prime power.

Original entry on oeis.org

4, 216, 24300000, 18010885410000000, 9993825885714653185036703100000000000, 16151740133123735772971793020980457559217933230000000000000
Offset: 1

Views

Author

Rick L. Shepherd, Jul 03 2002

Keywords

Comments

a(7) through a(10) have 98, 133, 193 and 285 digits, respectively.

Examples

			a(3) = 24300000 because (p(3)#)^p(3) = (5*3*2)^5 = 30^5 = 24300000.
		

Crossrefs

Cf. A002110 (primorials), A068210 ((p(n)!)^p(n)).

Programs

  • Mathematica
    With[{nn=6},First[#]^Last[#]&/@Thread[{Rest[FoldList[Times, 1, Prime[ Range[nn]]]],Prime[Range[nn]]}]] (* Harvey P. Dale, Mar 16 2012 *)
  • PARI
    for(n=1,6,print1((prod(k=1,n, prime(k)))^prime(n),","))

Formula

a(n) = (p(n)#)^p(n), where p(n) is n-th prime and # denotes primorial (A002110).