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 A092252 #11 Jun 29 2024 07:17:44
%S A092252 3,109,3911,80917,1366661,20491057,285058399,3767321791,47991893393,
%T A092252 594421377761,7201814452873,85713609222697,1005238339412819,
%U A092252 11644468481142713,133472665317708923,1516047373452105311
%N A092252 a(n) = prime(prime(10^n)).
%H A092252 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.
%F A092252 a(n) = A006450(10^n) = A000040(A006988(n)). - _Amiram Eldar_, Jun 29 2024
%t A092252 Table[Prime[Prime[10^n]], {n, 0, 10}] (* _Amiram Eldar_, Jun 29 2024 *)
%o A092252 (PARI) a(n) = prime(prime(10^n)); \\ _Amiram Eldar_, Jun 29 2024
%Y A092252 Cf. A000040, A006450, A006988, A096359.
%K A092252 nonn,more
%O A092252 0,1
%A A092252 _Cino Hilliard_, Feb 19 2004
%E A092252 a(9)-a(10) from Dennis Kluk, Nov 27 2005
%E A092252 a(11)-a(15) using Kim Walisch's primecount added by _Amiram Eldar_, Jun 29 2024