%I #22 Jun 09 2013 13:50:15
%S 2,2,11,41,569,1367
%N Least n-Ramanujan prime.
%C 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 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 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 nonn,more
%O 0,1
%A _T. D. Noe_, Jul 11 2011