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 A192824 #22 Jun 09 2013 13:50:15 %S A192824 2,2,11,41,569,1367 %N A192824 Least n-Ramanujan prime. %C A192824 We define the 0-Ramanujan primes to be the usual primes (A000040), and we define the 1-Ramanujan primes to be the Ramanujan primes (A104272). %C A192824 The sequence is only conjectural without a proof of an upper bound on a(n) (like the bound A104272(n) < prime(3*n) proved by Laishram and used in computing Ramanujan primes). - _Jonathan Sondow_, Aug 27 2011 %Y A192824 Cf. A104272 (Ramanujan primes), A192820 (2-Ramanujan primes), A192821 (3-Ramanujan primes), A192822 (4-Ramanujan primes), A192823 (5-Ramanujan primes), A225907 (least n-Ramanujan prime less than half the next n-Ramanujan prime, or 0 if none). %K A192824 nonn,more %O A192824 0,1 %A A192824 _T. D. Noe_, Jul 11 2011