|
Search: id:A065133
|
|
|
| A065133 |
|
Remainder when n-th prime is divided by the number of primes not exceeding n. |
|
+0
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; listen)
|
|
|
OFFSET
|
2,4
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=2,...,1000
|
|
FORMULA
|
a(n) = Mod[prime(n), Pi(n)] = Mod[A000040(n), A000720(n)], n>1
|
|
EXAMPLE
|
n = 2: Pi(2) = 1, p(2) = 3, Mod[3,1] = 0, the first term = a(2); n = 100: Pi(100) = 25, p(100) = 541, Mod[541,25] = 1 = a(100)
|
|
PROGRAM
|
(PARI) { for (n=2, 1000, write("b065133.txt", n, " ", prime(n)%primepi(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 11 2009]
|
|
CROSSREFS
|
Cf. A000720, A000040, A065134, A004648.
Sequence in context: A048804 A158565 A132422 this_sequence A080381 A080396 A155582
Adjacent sequences: A065130 A065131 A065132 this_sequence A065134 A065135 A065136
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 15 2001
|
|
|
Search completed in 0.002 seconds
|
