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
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, 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, 9, 1, 7, 6, 8, 1, 7, 4, 10, 5, 9, 4, 1, 5, 2, 1, 3, 2, 4, 10, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(A049084(A137977(n-1))) = even; a(A049084(A137978(n-1))) = odd. - Reinhard Zumkeller, Feb 25 2008
LINKS
MAPLE
seq(ithprime(n) mod 11, n=1..100); # Nathaniel Johnston, Jun 29 2011
MATHEMATICA
Mod[Prime@ Range@ 86, 11] (* Robert G. Wilson v *)
PROG
(PARI) primes(1000)%11 \\ Charles R Greathouse IV, Mar 13 2011
(Magma) [p mod 11: p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014
CROSSREFS
Sequence in context: A185107 A042939 A115259 * A346512 A104250 A171013
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Dec 11 1999
STATUS
approved

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 June 8 16:56 EDT 2023. Contains 363165 sequences. (Running on oeis4.)