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 A191554 #13 Jan 03 2021 17:30:31
%S A191554 2,18,11250,64854011250,2980024297506569894680811250,
%T A191554 1319492964487055911863581348741902326769016593763234907139211250
%N A191554 a(n) = Product_{k=1..n} prime(k)^(2^(k-1)).
%C A191554 x^(2^n) - a(n) is the minimal polynomial over Q for the algebraic number sqrt(p(n)*sqrt(p(n-1)*...*sqrt(p(2)*sqrt(p(1)))...)), where p(k) is the k-th prime. Each such monic polynomial is irreducible by Eisenstein's Criterion (using p = 2).
%F A191554 For n > 1, a(n) = a(n-1) * prime(n)^(2^(n-1)); a(1) = prime(1).
%e A191554 a(1) = 2^1 = 2 and x^2 - 2 is the minimal polynomial for the algebraic number sqrt(2).
%e A191554 a(4) = 2^1*3^2*5^4*7^8 = 64854011250 and x^16 - 64854011250 is the minimal polynomial for the algebraic number sqrt(7*sqrt(5*sqrt(3*sqrt(2)))).
%o A191554 (PARI) a(n) = prod(k=1, n, prime(k)^(2^(k-1)))
%Y A191554 Cf. A191555.
%K A191554 nonn,easy
%O A191554 1,1
%A A191554 _Rick L. Shepherd_, Jun 05 2011