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!)
A072623 Numbers n such that A065863(n) = 1, i.e., prime(n) mod (n - Pi(n)) = 1. 1
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; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A004648, A065134 and A065863 behave similarly; they grow relatively slowly and drop 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.
LINKS
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, Print[n]], {n, 1, 150000000}]
(* Second program: *)
Position[Table[Mod[Prime[n], n - PrimePi[n]], {n, 10^6}], 1] // Flatten (* Michael De Vlieger, Jul 30 2017 *)
CROSSREFS
Sequence in context: A050037 A113005 A301423 * A006144 A047429 A301289
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 26 2002
EXTENSIONS
Edited by Robert G. Wilson v, Jun 27 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 24 03:05 EDT 2024. Contains 374575 sequences. (Running on oeis4.)