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.
%I A073436 #35 Mar 17 2023 18:45:57
%S A073436 2,3,5,7,16,21,22,25,26,29,32,65,66,70,77,78,82,86,87,88,92,93,94,95,
%T A073436 99,106,116,117,118,119,218,219,220,221,222,247,248,249,250,255,256,
%U A073436 261,262,267,268,289,290,291,292,297,298,299,300,301,302,303,304,305,306
%N A073436 Smallest k such that k mod pi(k) = n.
%C A073436 a(n) > a(n-1) except for 68, 180, 1051, 6454, 6456, 6459, 40073, 40078, ..., . - _Robert G. Wilson v_, Feb 24 2023
%H A073436 Giovanni Resta, <a href="/A073436/b073436.txt">Table of n, a(n) for n = 0..10000</a>
%F A073436 a(n) = Min{k: k mod A000720(k) = n} = Min{k: A065134(k) = n}.
%e A073436 Remainder 7 appears first as 25 mod pi(25) = 25 mod 9 = 7, so a(7) = 25.
%p A073436 with(numtheory); f:=proc(n) local i,j,k; for i from 2 to 10000 do if i mod pi(i) = n then RETURN(i); fi; od: RETURN(-1); end; # _N. J. A. Sloane_, Sep 01 2008
%t A073436 a = Compile[{{n, _Integer}}, Block[{k = 2}, While[ Mod[k, PrimePi@ k] != n, k++]; k]]; Array[a, 59, 0] (* _Robert G. Wilson v_, Feb 24 2023 *)
%o A073436 (PARI) a(n)={my(q=0, k=2);forprime(p=3, oo, q++; while(k<p, if(k%q==n, return(k)); k++))} \\ _Andrew Howroyd_, Feb 23 2023
%Y A073436 Cf. A000720, A038625, A057809, A065134, A073435, A073437, A360789.
%K A073436 nonn
%O A073436 0,1
%A A073436 _Labos Elemer_, Jul 31 2002
%E A073436 a(0) from _Robert G. Wilson v_, Feb 23 2023