

A079952


Number of primes less than prime(n)/2.


5



0, 0, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 12, 13, 14, 15, 15, 15, 16, 16, 16, 18, 18, 19, 19, 21, 21, 21, 22, 23, 23, 24, 24, 24, 24, 25, 25, 27, 29, 30, 30, 30, 30, 30, 30, 31, 32, 32, 32, 33, 34, 34, 34, 36, 36, 36, 37, 38, 39, 40
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

Previous name: Number of primes p such that prime(n) mod 2*p < prime(n).


LINKS



FORMULA

Where defined, that is for n > 2, prime(a(n)) = A055377(prime(n)).  Peter Munn, Sep 18 2017


EXAMPLE

n = 6: prime(6) = 13 and 2, 3, 5 are less than 13/2, therefore a(6) = 3.


MATHEMATICA



PROG



CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



