login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078655 a(n) = prime(k) where k = n-th prime congruent to 1 mod 6. 2

%I #11 Sep 08 2022 08:45:08

%S 17,41,67,127,157,191,283,331,367,401,509,563,599,709,797,877,919,967,

%T 1087,1171,1217,1297,1409,1447,1523,1741,1787,1847,2027,2081,2221,

%U 2269,2351,2477,2549,2609,2719,2803,2909,3019,3067,3229,3299,3469,3559

%N a(n) = prime(k) where k = n-th prime congruent to 1 mod 6.

%H Vincenzo Librandi, <a href="/A078655/b078655.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A000040(A002476(n)). [_Bruno Berselli_, Aug 14 2012]

%t With[{pc14=Select[Prime[Range[1000]],Mod[#,6]==1&]},Flatten[Table[Prime[Take[pc14,{n}]],{n,100}]]] (* _Vincenzo Librandi_, Aug 14 2012 *)

%t Prime[Select[Prime[Range[100]],Mod[#,6]==1&]] (* _Harvey P. Dale_, Feb 01 2022 *)

%o (PARI) pip(n,m,r) = {sr=0; forprime(x=3,n, if(x%m == r,v=prime(x); sr+=1.0/v; print1(v" "); ) ); print(); print("m="m" r="r" sr="sr); }

%o (Magma) [NthPrime(n): n in PrimesUpTo(500) | n mod 6 eq 1]; // _Bruno Berselli_, Aug 14 2012

%K nonn,easy

%O 1,1

%A _Cino Hilliard_, Dec 14 2002

%E Offset changed from 0 to 1 by _Vincenzo Librandi_, Aug 14 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 3 12:15 EDT 2024. Contains 375669 sequences. (Running on oeis4.)