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.

A046967 a(1) = 2, a(n) = a(n-1)^prime(n) for n > 1.

Original entry on oeis.org

2, 8, 32768, 40564819207303340847894502572032
Offset: 1

Views

Author

Keywords

Examples

			a(3) = 32768 because (2^3)^5 = 32768.
		

Crossrefs

Cf. A070826.

Programs

  • Mathematica
    RecurrenceTable[{a[1]==2,a[n]==a[n-1]^Prime[n]},a[n],{n,4}] (* Harvey P. Dale, Jul 18 2011 *)
    2^FoldList[Times, 1, Prime[Range[2, 4]]] (* Amiram Eldar, Oct 12 2024 *)
  • PARI
    a(n)=if(n<2,1,a(n-1)^prime(n)) \\ Charles R Greathouse IV, Jun 20 2013

Formula

a(n) = 2^A070826(n). - Amiram Eldar, Oct 12 2024