cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073326 Smallest x such that prime(x) == n (mod (x-pi(x)-1)).

This page as a plain text file.
%I A073326 #23 Sep 03 2019 09:40:52
%S A073326 6,67,9,10,13,96,15,16,74,73,32,85,31,4086,228,611,28,30,44,616,263,
%T A073326 617,43,4090,47,633,241,631,49,122195143823,48,102,123,622,62,120,65,
%U A073326 103,112,108,64,4094,63,127,271,109,128,129,70,132,133,137,131,4060,644
%N A073326 Smallest x such that prime(x) == n (mod (x-pi(x)-1)).
%F A073326 a(n) = Min{x : A000040(x) == n (mod (x-A000720(x)-1)) }.
%e A073326 p(10) mod (10-PrimePi(10)-1) = 29 mod (10-4-1) = 29 mod 5 = 4 and a(4)=10.
%t A073326 a[n_] := (k = 4; While[ Mod[ Prime[k], k - PrimePi[k] - 1] != n, k++ ]; k); Table[ a[n], {n, 1, 29}]
%Y A073326 Cf. A000040, A000720, A073324, A073326.
%K A073326 nonn
%O A073326 1,1
%A A073326 _Labos Elemer_, Jul 30 2002
%E A073326 Edited by _Robert G. Wilson v_, Jul 31 2002
%E A073326 a(30) from _Giovanni Resta_, Sep 02 2019