This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2017 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A034785 a(n) = 2^(n-th prime). 31

%I

%S 4,8,32,128,2048,8192,131072,524288,8388608,536870912,2147483648,

%T 137438953472,2199023255552,8796093022208,140737488355328,

%U 9007199254740992,576460752303423488,2305843009213693952

%N a(n) = 2^(n-th prime).

%C These are the "outputs" in Conway's PRIMEGAME (see A007542). - _Alonso del Arte_, Jan 03 2011

%C Multiplicative encoding of the n-th prime. - _Daniel Forgues_, Feb 26 2017

%H Vincenzo Librandi, <a href="/A034785/b034785.txt">Table of n, a(n) for n = 1..200</a>

%H <a href="/index/Di#divseq">Index to divisibility sequences</a>

%e a(4) = 128 because the fourth prime number is 7 and 2^7 = 128.

%t 2^Prime@Range@40 (* _Vladimir Joseph Stephan Orlovsky_, Apr 11 2011 *)

%o a034785 = (2 ^) . a000040

%o -- _Reinhard Zumkeller_, Feb 07 2015, Jan 24 2012

%o (PARI) a(n)=1<<prime(n) \\ _Charles R Greathouse IV_, Apr 07 2012

%o (MAGMA) [2^p: p in PrimesUpTo(100)]; // _Vincenzo Librandi_, Apr 29 2014

%Y Cf. A000430, A073718 2^(n-th composite), A074736.

%K easy,nonn

%O 1,1

%A Asher Auel (asher.auel(AT)reed.edu)

%E More terms from _James A. Sellers_, Feb 04 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 05:49 EST 2018. Contains 318044 sequences. (Running on oeis4.)