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 A062772 #28 Dec 13 2024 06:30:00
%S A062772 5,11,29,53,127,173,293,367,541,853,967,1373,1693,1861,2213,2819,3491,
%T A062772 3727,4493,5051,5333,6247,6899,7927,9413,10211,10613,11467,11887,
%U A062772 12781,16139,17167,18773,19333,22229,22807,24659,26573,27893,29947,32051
%N A062772 Smallest prime larger than square of n-th prime.
%C A062772 Subsequence of A007491. - _Zak Seidov_, Apr 30 2015
%H A062772 Harry J. Smith, <a href="/A062772/b062772.txt">Table of n, a(n) for n = 1..1000</a>
%F A062772 a(n) = A007918(A001248(n)) = A151800(A001248(n)). - _Michel Marcus_, Jun 24 2014
%F A062772 a(n) = A007491(A000040(n)). - _Zak Seidov_, Apr 30 2015
%e A062772 100th prime, 541 immediately follows 529, square of 9th prime.
%p A062772 with(numtheory): [seq(nextprime(ithprime(w)^2),w=1..100)];
%t A062772 Array[NextPrime[Prime[#]^2] &, 41] (* _Michael De Vlieger_, Nov 02 2017 *)
%o A062772 (PARI) a(n) = { nextprime(prime(n)^2) } \\ _Harry J. Smith_, Aug 10 2009
%Y A062772 Cf. A054270, A054271, A000879.
%Y A062772 Cf. A007491. - _Zak Seidov_, Apr 30 2015
%K A062772 nonn,easy
%O A062772 1,1
%A A062772 _Labos Elemer_, Jul 18 2001