A076501 a(n) is the smallest (prime) integer such that the sequence {p_1, p_2, ..., p_n = a(n)} consists entirely of primes, where p_i = a(n)^(i/n).

2, 5, 13, 31, 73, 173, 409, 967, 3450844193, 39661481813, 2076849234433, 52134281654579, 14838980942616539, 260230524377962793, 4563650703502319197, 80032531899785490253, 172111744128569095516889

Offset

1,1

References

R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see Exercise 1.75, p. 69.

Links

Table of n, a(n) for n=1..17.

Example

a(8) = 967 because the sequence {2, 5, 13, 31, 73, 173, 409, 967} consists entirely of primes, the i-th term in the sequence being Floor[967^(i/8)] and 967 is the smallest integer with this property.

Crossrefs

Cf. A063636, A076255, A076357.

Sequence in context: A116701 A068739 A063636 * A369434 A349276 A307569

Adjacent sequences: A076498 A076499 A076500 * A076502 A076503 A076504

Keyword

nonn

Author

David Terr (dterr(AT)wolfram.com), Nov 08 2002

Status

approved