login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A191554
a(n) = Product_{k=1..n} prime(k)^(2^(k-1)).
4
2, 18, 11250, 64854011250, 2980024297506569894680811250, 1319492964487055911863581348741902326769016593763234907139211250
OFFSET
1,1
COMMENTS
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).
FORMULA
For n > 1, a(n) = a(n-1) * prime(n)^(2^(n-1)); a(1) = prime(1).
EXAMPLE
a(1) = 2^1 = 2 and x^2 - 2 is the minimal polynomial for the algebraic number sqrt(2).
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)))).
PROG
(PARI) a(n) = prod(k=1, n, prime(k)^(2^(k-1)))
CROSSREFS
Cf. A191555.
Sequence in context: A309972 A208056 A276092 * A066361 A120929 A349886
KEYWORD
nonn,easy
AUTHOR
Rick L. Shepherd, Jun 05 2011
STATUS
approved