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.

This page as a plain text file.
%I A046967 #18 Oct 13 2024 07:08:28
%S A046967 2,8,32768,40564819207303340847894502572032
%N A046967 a(1) = 2, a(n) = a(n-1)^prime(n) for n > 1.
%H A046967 Amiram Eldar, <a href="/A046967/b046967.txt">Table of n, a(n) for n = 1..5</a>
%F A046967 a(n) = 2^A070826(n). - _Amiram Eldar_, Oct 12 2024
%e A046967 a(3) = 32768 because (2^3)^5 = 32768.
%t A046967 RecurrenceTable[{a[1]==2,a[n]==a[n-1]^Prime[n]},a[n],{n,4}] (* _Harvey P. Dale_, Jul 18 2011 *)
%t A046967 2^FoldList[Times, 1, Prime[Range[2, 4]]] (* _Amiram Eldar_, Oct 12 2024 *)
%o A046967 (PARI) a(n)=if(n<2,1,a(n-1)^prime(n)) \\ _Charles R Greathouse IV_, Jun 20 2013
%Y A046967 Cf. A070826.
%K A046967 nonn,nice
%O A046967 1,1
%A A046967 _Felice Russo_