login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A192824 Least n-Ramanujan prime. 6
2, 2, 11, 41, 569, 1367 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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).

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

LINKS

Table of n, a(n) for n=0..5.

CROSSREFS

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).

Sequence in context: A014220 A089544 A208967 * A184237 A069648 A275869

Adjacent sequences:  A192821 A192822 A192823 * A192825 A192826 A192827

KEYWORD

nonn,more

AUTHOR

T. D. Noe, Jul 11 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 19:02 EDT 2019. Contains 327137 sequences. (Running on oeis4.)