login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

LINKS

Table of n, a(n) for n=0..12.

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

Cf. A096508-A096512.

Cf. A096509-A096523.

Sequence in context: A238935 A033688 A058283 * A236178 A247389 A156476

Adjacent sequences:  A096507 A096508 A096509 * A096511 A096512 A096513

KEYWORD

more,nonn

AUTHOR

Labos Elemer, Jul 12 2004

EXTENSIONS

4 more terms from David Wasserman, Nov 16 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 03:06 EDT 2020. Contains 334696 sequences. (Running on oeis4.)