|
Search: id:A072623
|
|
|
| A072623 |
|
Numbers n such that A065863[n]=1, i.e. Mod[p(n),n-Pi(n)]=1. |
|
+0
2
|
|
| 4, 5, 6, 11, 19, 25, 34, 36, 75, 82, 87, 90, 94, 237, 604, 609, 614, 1583, 1592, 10466, 10467, 10498, 10504, 10505, 70501, 70511, 180227, 180294, 180358, 180443, 180447, 466078, 8103422, 21058343, 21058649, 143052872, 143052877, 143053068
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Mod[p(n), n] = A004648, Mod[n, Pi(n)] = A065134 and A065863(n) = Mod[p(n), n-Pi(n)] remainders behave similarly: grow relatively slowly and drops suddenly at unexpected values of n. Parity of A004648 behaves most regularly.
Each cluster of entries exceeds the previous cluster by a power of e.
|
|
EXAMPLE
|
For the cluster started at n=10466 the remainders of A065863(n) are as follows: {9089, 9092, 9117, 9127, 9148, 9159, 1, 1, 9180, 9183, 9182, 9179, 9172, 9169, 9168, 9177, 9176, 9178, 9183, 9192, 43}. It behaves like A004648 or A065134.
|
|
MATHEMATICA
|
Do[ If[ Mod[ Prime[n], n-PrimePi[n], 1] == 1, Print[n]], {n, 1, 150000000}]
|
|
CROSSREFS
|
Cf. A065860-A065863, A065133-A065135, A072608-A072610, A004648, A057809.
Sequence in context: A076138 A050037 A113005 this_sequence A006144 A047429 A055033
Adjacent sequences: A072620 A072621 A072622 this_sequence A072624 A072625 A072626
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 26 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 27 2002
|
|
|
Search completed in 0.002 seconds
|
