|
%I #6 Mar 21 2015 04:25:05
%S 11,131,1511,17351,199151,2285711,26233621,301089179,3455668247,
%T 39661481813,455203748458,5224475817304,59962484179977,
%U 688202919252740,7898659712736578,90654694294744401,1040464318828877723
%N a(n) = floor(t^n) where n=39661481813^(1/10) (approximately 11.4772). a(n) is prime for n<=10.
%C FEPS(10, 1) (the first floor exponential prime sequence of length 10).
%C See A076255 for more explanation of floor exponential prime sequences.
%C I found that past the first ten members, there were no powers of t which produce a prime <= 2000. - _Robert G. Wilson v_
%D Richard Crandall and Carl Pomerance, Prime Numbers - a Computational Perspective, Springer, 2001, page 69, exercise 1.75.
%e a(5) = floor(t^5) = floor(39661481813^(1/2)) = 199151.
%t Table[ Floor[39661481813^(n/10)], {n, 1, 17}]
%Y Cf. A063636, A076255.
%K nonn
%O 1,1
%A David Terr (dterr(AT)wolfram.com), Nov 06 2002
%E Edited and extended by _Robert G. Wilson v_, Nov 08 2002
|
