login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 0

%I

%S 2,5,13,31,73,173,409,967,3450844193,39661481813,2076849234433,

%T 52134281654579,14838980942616539,260230524377962793,

%U 4563650703502319197,80032531899785490253,172111744128569095516889

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

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

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

%Y Cf. A063636, A076255, A076357.

%K nonn

%O 1,1

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

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 July 19 22:14 EDT 2019. Contains 325168 sequences. (Running on oeis4.)