Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039709
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039709 a(n) = n-th prime modulo 11. +0
5
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; listen)
OFFSET

1,1

COMMENT

a(A049084(A137977(n-1))) = even; a(A049084(A137978(n-1))) = odd. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 25 2008

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..1000

CROSSREFS

Cf. A039703, A039705.

Sequence in context: A041000 A042939 A115259 this_sequence A104250 A020919 A126053

Adjacent sequences: A039706 A039707 A039708 this_sequence A039710 A039711 A039712

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research