login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A096510
a(n) is the smallest number x such that the number of prime powers (including primes, excluding 1), in the neighborhood of x with radius ceiling(log(x)), equals n.
1
1, 54, 2, 12, 3, 8, 4792, 75991, 284736, 6561003, 51448375, 964669618, 18320500423
OFFSET
0,2
COMMENTS
With increasing n the radius of log(n) slowly increases, while frequency of prime-powers decreases.
No more terms < 369*10^8. - David Wasserman, Nov 16 2007
EXAMPLE
a[8]=284736: because in [284723,284749] around a(8),
8 prime(powers) occur first,with radius=r=13;
a[0]=1;a[1]=54 means that in [50,58] only 53 is prime,r=4.
CROSSREFS
KEYWORD
more,nonn
AUTHOR
Labos Elemer, Jul 12 2004
EXTENSIONS
4 more terms from David Wasserman, Nov 16 2007
STATUS
approved