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!)
A039709 a(n) = n-th prime modulo 11. 18

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

%S 2,3,5,7,0,2,6,8,1,7,9,4,8,10,3,9,4,6,1,5,7,2,6,1,9,2,4,8,10,3,6,10,5,

%T 7,6,8,3,9,2,8,3,5,4,6,10,1,2,3,7,9,2,8,10,9,4,10,5,7,2,6,8,7,10,3,5,

%U 9,1,7,6,8,1,7,4,10,5,9,4,1,5,2,1,3,2,4,10,3

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

%C a(A049084(A137977(n-1))) = even; a(A049084(A137978(n-1))) = odd. - _Reinhard Zumkeller_, Feb 25 2008

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

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

%t Mod[Prime@ Range@ 86, 11] (* _Robert G. Wilson v_ *)

%o (PARI) primes(1000)%11 \\ _Charles R Greathouse IV_, Mar 13 2011

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

%Y Cf. A000040, A039703, A039705, A039710-A039715.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Dec 11 1999

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)