This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065133 Remainder when n-th prime is divided by the number of primes not exceeding n. 7
 0, 1, 1, 2, 1, 1, 3, 3, 1, 1, 2, 5, 1, 5, 5, 3, 5, 3, 7, 1, 7, 2, 8, 7, 2, 4, 8, 9, 3, 6, 10, 5, 7, 6, 8, 1, 7, 11, 5, 10, 12, 9, 11, 1, 3, 1, 13, 2, 4, 8, 14, 1, 11, 1, 7, 13, 15, 5, 9, 13, 5, 1, 5, 7, 11, 8, 14, 5, 7, 13, 19, 10, 16, 1, 5, 11, 19, 5, 13, 1, 3, 17, 19, 2, 6, 12, 20, 5, 7, 11, 23 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,4 LINKS Harry J. Smith, Table of n, a(n) for n = 2..1000 FORMULA a(n) = prime(n) mod pi(n) = A000040(n) mod A000720(n), n > 1. EXAMPLE n = 2: pi(2) = 1, prime(2) = 3, 3 mod 1 = 0, the first term = a(2); n = 100: pi(100) = 25, prime(100) = 541, 541 mod 25 = 16 = a(100). [corrected by Jon E. Schoenfield, Jun 18 2018] MATHEMATICA Table[Mod[Prime[n], PrimePi[n]], {n, 2, 100}] (* Harvey P. Dale, Nov 28 2013 *) PROG (PARI) { for (n=2, 1000, write("b065133.txt", n, " ", prime(n)%primepi(n)) ) } \\ Harry J. Smith, Oct 11 2009 CROSSREFS Cf. A000720, A000040, A065134, A004648. Sequence in context: A048804 A158565 A132422 * A307239 A204087 A080381 Adjacent sequences:  A065130 A065131 A065132 * A065134 A065135 A065136 KEYWORD nonn AUTHOR Labos Elemer, Oct 15 2001 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 25 23:48 EDT 2019. Contains 322465 sequences. (Running on oeis4.)