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.
%I A076357 #16 Apr 01 2025 17:24:27
%S A076357 1,11,131,1511,17351,199151,2285711,26233621,301089179,3455668247,
%T A076357 39661481813,455203748458,5224475817304,59962484179977,
%U A076357 688202919252740,7898659712736578,90654694294744401,1040464318828877723,11941643035453940036,137056923342374688074
%N A076357 a(n) = floor(t^n) where t = 39661481813^(1/10) (approximately 11.4772).
%C A076357 FEPS(10, 1) (the first floor exponential prime sequence of length 10).
%C A076357 See A076255 for more explanation of floor exponential prime sequences.
%C A076357 a(n) is prime for n = 1..10.
%C A076357 I found that past the first ten members, there are no powers of t which produce a prime <= 2000. - _Robert G. Wilson v_, Nov 08 2002
%D A076357 Richard Crandall and Carl Pomerance, Prime Numbers - a Computational Perspective, Springer, 2001, page 69, exercise 1.75.
%e A076357 a(5) = floor(t^5) = floor(39661481813^(1/2)) = 199151.
%t A076357 Table[ Floor[39661481813^(n/10)], {n, 1, 17}]
%Y A076357 Cf. A063636, A076255.
%K A076357 nonn
%O A076357 0,2
%A A076357 _David Terr_, Nov 06 2002
%E A076357 Edited and extended by _Robert G. Wilson v_, Nov 08 2002