login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126588 a(n) = prime(13*n). 2

%I

%S 41,101,167,239,313,397,467,569,643,733,823,911,1009,1091,1187,1283,

%T 1381,1481,1567,1657,1753,1871,1979,2069,2153,2273,2371,2459,2591,

%U 2687,2767,2861,2971,3089,3217,3323,3433,3533,3623,3727,3847,3931,4051,4157

%N a(n) = prime(13*n).

%C Old name was "Every 13th prime number".

%H Jens Kruse Andersen, <a href="/A126588/b126588.txt">Table of n, a(n) for n = 1..10000</a>

%e The 13th prime is 41, the first entry in the table.

%t Prime[Range[13, 50*13, 13]] (* _Harvey P. Dale_, May 14 2011 *)

%o (PARI) a(n)=prime(13*n) \\ _Edward Jiang_, Sep 08 2014

%o (Sage) [nth_prime(13*n) for n in (1..50)] # _Bruno Berselli_, May 07 2014

%o (MAGMA) [NthPrime(13*n): n in [1..30]]; // _G. C. Greubel_, Mar 06 2018

%Y Cf. similar sequences listed in A031336.

%K nonn,easy

%O 1,1

%A _Cino Hilliard_, Jan 05 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 14:07 EST 2021. Contains 340254 sequences. (Running on oeis4.)