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!)
A280379 a(n) = A056171(k) - m, where k=prime(n) and m is the Ramanujan prime index to the greatest Ramanujan prime R(m) <= k. 1
0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 2, 0, 1, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 2, 2, 3, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,30
COMMENTS
a(n)=0 corresponds to the Ramanujan prime R_m = A104272(m) = A056171(k).
LINKS
FORMULA
a(n) = A056171(k) - m, where k=prime(n) and m is the Ramanujan prime index to the greatest Ramanujan prime R_m = A104272(m) <= k.
EXAMPLE
For prime(30)=113, A056171(113) = 14, 107 is R_12 and 127 is R_13, so 14 -12 = 2 (first occurrence).
PROG
(PARI) \\RR[x] is a list of Ramanujan primes, A104272.
{plimit=1.1*10^4; n=s=0;
forprime(p=2, plimit,
s++;
if(p==RR[n+1], n++);
print1(s-primepi(floor(p/2))-n, ", ");
)
}
CROSSREFS
Sequence in context: A219987 A077614 A336396 * A333307 A180793 A352523
KEYWORD
nonn
AUTHOR
John W. Nicholson, Jan 01 2017
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 24 11:40 EDT 2024. Contains 371936 sequences. (Running on oeis4.)