This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A071168 n-th prime reduced modulo phi(n). 2
 0, 0, 1, 1, 3, 1, 5, 3, 5, 1, 1, 1, 5, 1, 7, 5, 11, 1, 13, 7, 1, 9, 17, 1, 17, 5, 13, 11, 25, 1, 7, 3, 17, 11, 5, 7, 13, 1, 23, 13, 19, 1, 23, 13, 5, 1, 27, 15, 17, 9, 9, 23, 33, 17, 17, 23, 17, 19, 45, 9, 43, 23, 19, 23, 25, 17, 1, 17, 39, 13, 3, 23, 7, 13, 19, 23, 29, 13, 11, 25, 41 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Michel Marcus, Table of n, a(n) for n = 1..10000 FORMULA a(n) = prime(n) mod phi(n) = A000040(n) mod A000010(n). MAPLE with(numtheory): A071168:=n->ithprime(n) mod phi(n): seq(A071168(n), n=1..100); # Wesley Ivan Hurt, Feb 11 2017 MATHEMATICA Table[Mod[Prime[w], EulerPhi[w]], {w, 1, 128}] PROG (PARI) a(n) = prime(n) % eulerphi(n); \\ Michel Marcus, Feb 12 2017 CROSSREFS Cf. A000040, A000010, A066936, A071169. Sequence in context: A239626 A076363 A143865 * A091926 A109606 A127418 Adjacent sequences:  A071165 A071166 A071167 * A071169 A071170 A071171 KEYWORD nonn,easy,look AUTHOR Labos Elemer, May 15 2002 STATUS approved

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

Last modified March 23 11:24 EDT 2018. Contains 301123 sequences. (Running on oeis4.)