This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 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!)
 A031215 a(n) = prime(2n). 28
 3, 7, 13, 19, 29, 37, 43, 53, 61, 71, 79, 89, 101, 107, 113, 131, 139, 151, 163, 173, 181, 193, 199, 223, 229, 239, 251, 263, 271, 281, 293, 311, 317, 337, 349, 359, 373, 383, 397, 409, 421, 433, 443, 457, 463, 479, 491, 503, 521, 541, 557, 569 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Also every second odd prime. - Cino Hilliard, Dec 02 2007 If n > 1, then a(n) is less than, and asymptotic to, the n-th Ramanujan prime R_n = A104272(n). Research questions on the difference R_n - a(n) are at A104272. - Jonathan Sondow, Dec 16 2013 LINKS Jens Kruse Andersen, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A104272(n) - A233739(n). - Jonathan Sondow, Dec 16 2013 MAPLE A031215 := n->ithprime(2*n); MATHEMATICA Table[ Prime[ 2n], {n, 52}] (* Robert G. Wilson v, Dec 01 2013 *) PROG (MAGMA) [ NthPrime(2*n): n in [1..1000] ]; // Vincenzo Librandi, Apr 11 2011 (PARI) a(n)=prime(2*n) \\ Charles R Greathouse IV, Jul 02 2013 CROSSREFS Cf. A000040, A031368, A104272, A179740, A233739. Sequence in context: A000960 A147614 A171747 * A099957 A086148 A262086 Adjacent sequences:  A031212 A031213 A031214 * A031216 A031217 A031218 KEYWORD nonn,easy AUTHOR STATUS approved

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 18 18:37 EST 2018. Contains 318243 sequences. (Running on oeis4.)