login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214926 Difference A214925(n) - A214924(n), prime count between Ramanujan primes bounding maximal gap primes. 4
4, 4, 4, 3, 5, 3, 8, 7, 5, 7, 7, 3, 10, 6, 8, 24, 19, 6, 24, 25, 16, 8, 30, 17, 12, 13, 12, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: For every n > 0, a(n) > 1.
Let rho(m) = A179196(m), for any n, let m be an integer such that p_(rho(m)) <= p_n and p_(n+1) <= p_(rho(m+1)), then rho(m) <= n < n + 1 <= rho(m + 1), therefore A001223(n) = p_(n+1) - p_n <= p_rho(m+1) - p_rho(m) = A182873(m). For all rho(m) = A179196(m), A001223(rho(m)) < A165959(m). (Comment copied from A001223). John W. Nicholson, Nov 17 2013
LINKS
FORMULA
a(n) = pi(A214757(n)) - pi(A214756(n)).
a(n) = rho(A214757(n)) - rho(A214756(n)).
EXAMPLE
a(4) = pi(A214757(4)) - pi(A214756(4)) = 10 - 7 = 3
CROSSREFS
Sequence in context: A023977 A073259 A174987 * A268368 A274947 A331961
KEYWORD
nonn
AUTHOR
John W. Nicholson, Aug 06 2012
EXTENSIONS
Extension to a(28) added by John W. Nicholson, Nov 11 2013
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)