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!)
A039705 a(n) = n-th prime modulo 7. 10

%I #17 Sep 08 2022 08:44:53

%S 2,3,5,0,4,6,3,5,2,1,3,2,6,1,5,4,3,5,4,1,3,2,6,5,6,3,5,2,4,1,1,5,4,6,

%T 2,4,3,2,6,5,4,6,2,4,1,3,1,6,3,5,2,1,3,6,5,4,3,5,4,1,3,6,6,3,5,2,2,1,

%U 4,6,3,2,3,2,1,5,4,5,2,3,6,1,4,6,5,2,1,2,6,1,5,3,4,1,2,6,5,3,5,2,1,4,3,2,4

%N a(n) = n-th prime modulo 7.

%C a(A049084(A045370(n-1))) is even; a(A049084(A045415(n-1))) is odd. - _Reinhard Zumkeller_, Feb 25 2008

%H R. Zumkeller, <a href="/A039705/b039705.txt">Table of n, a(n) for n = 1..1000</a>

%p seq(ithprime(n) mod 7, n=1..105); # _Nathaniel Johnston_, Jun 29 2011

%t Table[Mod[Prime[n], 7], {n, 105}] (* _Nathaniel Johnston_, Jun 29 2011 *)

%t Mod[Prime[Range[100]], 7] (* _Vincenzo Librandi_, May 06 2014 *)

%o (Magma) [p mod(7): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014

%o (PARI) primes(100)%7 \\ _Charles R Greathouse IV_, May 06 2014

%Y Cf. A039701-A039704, A039706, A038194, A007652, A039709-A039715.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_

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 April 23 07:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)