OFFSET
0,3
COMMENTS
The sequence counts prime powers greater than n up to and including 2*n. - Harvey P. Dale, Aug 01 2020
MATHEMATICA
Table[Count[Range[n+1, 2n], _?PrimePowerQ], {n, 0, 80}] (* Harvey P. Dale, Aug 01 2020 *)
PROG
(SageMath)
def a(n) : return sum([1 for k in (n+1..2*n) if is_prime_power(k)])
print([a(n) for n in (0..72)])
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Nov 18 2019
STATUS
approved