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 A062448 #10 Nov 28 2017 08:31:43 %S A062448 2,2,7,103,1619,28687,567871,12579617,310248241,8448283757, %T A062448 252097800623,8187297276401,287629183566841,10871811891162227, %U A062448 440023773804299591 %N A062448 Prime numbers at large subscripts: a(n) = prime(n^n). %C A062448 The n^n-th prime. - _Hugo Pfoertner_, Nov 28 2017 %H A062448 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation</a>. %F A062448 a(n) = A000040(A000312(n)). %e A062448 a(10) = prime(10000000000) = 252097800623. %Y A062448 Cf. A000040, A000312, A002110, A000142, A000079, A033844. %K A062448 hard,nonn %O A062448 0,1 %A A062448 _Labos Elemer_, Jul 09 2001 %E A062448 a(12)-a(14) from _Hugo Pfoertner_, Nov 28 2017