Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096510
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
1
1, 54, 2, 12, 3, 8, 4792, 75991, 284736, 6561003, 51448375, 964669618, 18320500423 (list; graph; listen)
OFFSET

0,2

COMMENT

With increasing n the radius of log(n) slowly increases, while frequency of prime-powers decreases.

No more terms < 369*10^8. - David Wasserman (dwasserm(AT)earthlink.net), 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

Cf. A096508-A096512.

Cf. A096509-A096523.

Sequence in context: A022080 A033688 A058283 this_sequence A137939 A033374 A116386

Adjacent sequences: A096507 A096508 A096509 this_sequence A096511 A096512 A096513

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 12 2004

EXTENSIONS

4 more terms from David Wasserman (dwasserm(AT)earthlink.net), Nov 16 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research