login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039706 a(n) = n-th prime modulo 8. 15
2, 3, 5, 7, 3, 5, 1, 3, 7, 5, 7, 5, 1, 3, 7, 5, 3, 5, 3, 7, 1, 7, 3, 1, 1, 5, 7, 3, 5, 1, 7, 3, 1, 3, 5, 7, 5, 3, 7, 5, 3, 5, 7, 1, 5, 7, 3, 7, 3, 5, 1, 7, 1, 3, 1, 7, 5, 7, 5, 1, 3, 5, 3, 7, 1, 5, 3, 1, 3, 5, 1, 7, 7, 5, 3, 7, 5, 5, 1, 1, 3, 5, 7, 1, 7, 3, 1, 1, 5, 7, 3, 7, 7, 3, 3, 7, 5, 1, 3, 5, 3, 5, 3, 1, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

MAPLE

seq(ithprime(n) mod 8, n=1..105); # Nathaniel Johnston, Jun 29 2011

MATHEMATICA

Table[Mod[Prime[n], 8], {n, 105}] (* Nathaniel Johnston, Jun 29 2011 *)

CROSSREFS

Cf. A039701-A039705, A038194, A007652, A039709-A039715.

Sequence in context: A115260 A143950 A108534 * A156208 A073034 A126050

Adjacent sequences:  A039703 A039704 A039705 * A039707 A039708 A039709

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:30 EST 2012. Contains 205907 sequences.