login
The OEIS is supported by the many generous donors to the OEIS 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

%I #7 Oct 15 2013 22:32:26

%S 1,54,2,12,3,8,4792,75991,284736,6561003,51448375,964669618,

%T 18320500423

%N 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.

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

%C No more terms < 369*10^8. - _David Wasserman_, Nov 16 2007

%e a[8]=284736: because in [284723,284749] around a(8),

%e 8 prime(powers) occur first,with radius=r=13;

%e a[0]=1;a[1]=54 means that in [50,58] only 53 is prime,r=4.

%Y Cf. A096508-A096512.

%Y Cf. A096509-A096523.

%K more,nonn

%O 0,2

%A _Labos Elemer_, Jul 12 2004

%E 4 more terms from _David Wasserman_, Nov 16 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)