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 A126094 #15 Mar 24 2019 06:11:01 %S A126094 4,7,22,83,5878,12229,14871,43360,120833116,284116756,384239518, %T A126094 586968768,2697787565123,11550434172799,65612899915231, %U A126094 252252704148332,2105877470620834,36504944044141057,4194084944223361535 %N A126094 Numbers k such that prime(k) = A123206(n). %H A126094 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>. %F A126094 a(n) = A000720(A123206(n)). %Y A126094 Cf. A000720, A123206. %K A126094 hard,more,nonn %O A126094 1,1 %A A126094 _Alexander Adamchuk_, Mar 03 2007 %E A126094 a(13)-a(14) from _Max Alekseyev_, Feb 23 2012 %E A126094 a(15)-a(19) using Kim Walisch's primecount, from _Amiram Eldar_, Mar 24 2019