cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

1, 54, 2, 12, 3, 8, 4792, 75991, 284736, 6561003, 51448375, 964669618, 18320500423
Offset: 0

Views

Author

Labos Elemer, Jul 12 2004

Keywords

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

Examples

			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

Extensions

4 more terms from David Wasserman, Nov 16 2007