This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126588 a(n) = prime(13*n). 2
 41, 101, 167, 239, 313, 397, 467, 569, 643, 733, 823, 911, 1009, 1091, 1187, 1283, 1381, 1481, 1567, 1657, 1753, 1871, 1979, 2069, 2153, 2273, 2371, 2459, 2591, 2687, 2767, 2861, 2971, 3089, 3217, 3323, 3433, 3533, 3623, 3727, 3847, 3931, 4051, 4157 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Old name was "Every 13th prime number". LINKS Jens Kruse Andersen, Table of n, a(n) for n = 1..10000 EXAMPLE The 13th prime is 41, the first entry in the table. MATHEMATICA Prime[Range[13, 50*13, 13]] (* Harvey P. Dale, May 14 2011 *) PROG (PARI) \List the m-th prime numbers less than or equal to n g(n, m) = forstep(x=m, n, m, print1(prime(x)", ")) (PARI) a(n)=prime(13*n) \\ Edward Jiang, Sep 08 2014 (Sage) [nth_prime(13*n) for n in (1..50)] # Bruno Berselli, May 07 2014 (MAGMA) [NthPrime(13*n): n in [1..30]]; // G. C. Greubel, Mar 06 2018 CROSSREFS Cf. similar sequences listed in A031336. Sequence in context: A228573 A273363 A309934 * A142794 A225888 A156971 Adjacent sequences:  A126585 A126586 A126587 * A126589 A126590 A126591 KEYWORD nonn,easy AUTHOR Cino Hilliard, Jan 05 2007 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 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)