The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A073326 Smallest x such that prime(x) == n (mod (x-pi(x)-1)). 3
 6, 67, 9, 10, 13, 96, 15, 16, 74, 73, 32, 85, 31, 4086, 228, 611, 28, 30, 44, 616, 263, 617, 43, 4090, 47, 633, 241, 631, 49, 122195143823, 48, 102, 123, 622, 62, 120, 65, 103, 112, 108, 64, 4094, 63, 127, 271, 109, 128, 129, 70, 132, 133, 137, 131, 4060, 644 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = Min{x : A000040(x) == n (mod (x-A000720(x)-1)) }. EXAMPLE p(10) mod (10-PrimePi(10)-1) = 29 mod (10-4-1) = 29 mod 5 = 4 and a(4)=10. MATHEMATICA a[n_] := (k = 4; While[ Mod[ Prime[k], k - PrimePi[k] - 1] != n, k++ ]; k); Table[ a[n], {n, 1, 29}] CROSSREFS Cf. A000040, A000720, A073324, A073326. Sequence in context: A082781 A257049 A099147 * A024203 A231598 A073562 Adjacent sequences:  A073323 A073324 A073325 * A073327 A073328 A073329 KEYWORD nonn AUTHOR Labos Elemer, Jul 30 2002 EXTENSIONS Edited by Robert G. Wilson v, Jul 31 2002 a(30) from Giovanni Resta, Sep 02 2019 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 January 22 02:06 EST 2020. Contains 331133 sequences. (Running on oeis4.)