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 A051143 #22 Feb 21 2025 15:09:01 %S A051143 1,2,3,4,5,26,2061,702993,307058572,3350187739,9088200428,43794115173, %T A051143 51932790219,378210209388,521301342188,297064987225918, %U A051143 19677201507658441,437852535314831447,1673669998972800207,29252504332047744188,42842701894337201916 %N A051143 Numbers k such that the k-th prime is a partition number. %H A051143 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>. %F A051143 a(n) = A000720(A049575(n)). %t A051143 PrimePi@Select[PartitionsP@Range@301, PrimeQ@# &] (* _Robert G. Wilson v_, Nov 14 2005 *) %Y A051143 Cf. A000040, A000041, A000720, A046063, A049575. %K A051143 nonn,nice %O A051143 1,2 %A A051143 _G. L. Honaker, Jr._ %E A051143 a(16)-a(21) using Kim Walisch's primecount, from _Amiram Eldar_, Jul 26 2019