Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004648
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004648 a(n) = n-th prime read mod n. +0
38
0, 1, 2, 3, 1, 1, 3, 3, 5, 9, 9, 1, 2, 1, 2, 5, 8, 7, 10, 11, 10, 13, 14, 17, 22, 23, 22, 23, 22, 23, 3, 3, 5, 3, 9, 7, 9, 11, 11, 13, 15, 13, 19, 17, 17, 15, 23, 31, 31, 29, 29, 31, 29, 35, 37, 39, 41, 39, 41, 41, 39, 45, 55, 55, 53, 53, 63, 65, 2, 69, 69, 71, 2, 3, 4, 3 (list; graph; listen)
OFFSET

1,3

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..10000

Labos, E. Graph of first 50000 terms

FORMULA

a(n) = prime(n)-n*floor(prime(n)/n)

MATHEMATICA

Table[Mod[Prime[n], n], {n, 100}] (from Zak Seidov Apr 25 2005)

PROGRAM

(PARI) for(n=1, 100, print1(prime(n)%n, ", "))

CROSSREFS

1's occur at A023143, 2's at A023144, 3's at A023145, 4's at A023146, 5's at A023146, 6's at A023148, 7's at A023149, 8's at A023150, 9's at A023151, 10's at A023152, == -1's at A045924.

For records see A127149, A127150.

Sequence in context: A077233 A123185 A133569 this_sequence A139438 A135392 A071947

Adjacent sequences: A004645 A004646 A004647 this_sequence A004649 A004650 A004651

KEYWORD

nonn

AUTHOR

njas, wild(AT)edumath.u-strasbg.fr (Daniel Wild)

EXTENSIONS

More terms from 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research