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!)
A004649 a(n) = prime(n) mod (n-1). 8
0, 1, 1, 3, 3, 5, 5, 7, 2, 1, 4, 5, 4, 5, 8, 11, 10, 13, 14, 13, 16, 17, 20, 1, 1, 25, 26, 25, 26, 7, 7, 9, 7, 13, 11, 13, 15, 15, 17, 19, 17, 23, 21, 21, 19, 27, 35, 35, 33, 33, 35, 33, 39, 41, 43, 45, 43, 45, 45, 43, 49, 59, 59, 57, 57, 1, 2, 7, 4, 3, 4, 7, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,4
LINKS
MATHEMATICA
Table[Mod[Prime[n], n - 1], {n, 2, 100}] (* Vincenzo Librandi, Sep 11 2014 *)
PROG
(PARI) a(n) = prime(n) % (n-1) \\ Michel Marcus, Jun 12 2013
(Magma) [NthPrime(n) mod (n-1): n in [2..90]]; // Vincenzo Librandi, Sep 11 2014
CROSSREFS
Sequence in context: A338215 A266251 A021302 * A367004 A328298 A002374
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Daniel Wild (wild(AT)edumath.u-strasbg.fr)
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 March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)