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

%I #18 Oct 13 2024 07:08:28

%S 2,8,32768,40564819207303340847894502572032

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

%H Amiram Eldar, <a href="/A046967/b046967.txt">Table of n, a(n) for n = 1..5</a>

%F a(n) = 2^A070826(n). - _Amiram Eldar_, Oct 12 2024

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

%t RecurrenceTable[{a[1]==2,a[n]==a[n-1]^Prime[n]},a[n],{n,4}] (* _Harvey P. Dale_, Jul 18 2011 *)

%t 2^FoldList[Times, 1, Prime[Range[2, 4]]] (* _Amiram Eldar_, Oct 12 2024 *)

%o (PARI) a(n)=if(n<2,1,a(n-1)^prime(n)) \\ _Charles R Greathouse IV_, Jun 20 2013

%Y Cf. A070826.

%K nonn,nice

%O 1,1

%A _Felice Russo_