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”).

A165422
a(1) = 1, a(2) = 4, a(n) = product of the previous terms for n >= 3.
1
1, 4, 4, 16, 256, 65536, 4294967296, 18446744073709551616, 340282366920938463463374607431768211456, 115792089237316195423570985008687907853269984665640564039457584007913129639936
OFFSET
1,2
LINKS
FORMULA
a(1) = 1, a(2) = 4, a(n) = Product_{i=1..n-1} a(i), n >= 3.
a(1) = 1, a(2) = 4, a(n) = A000302(2^(n-3)) = A001146(n-2) = 2^(2^(n-2)), n >= 3.
a(1) = 1, a(2) = 4, a(3) = 4, a(n) = (a(n-1))^2, n >= 4.
MATHEMATICA
a[1]:= 1; a[2]:= 4; a[n_] := Product[a[j], {j, 1, n-1}]; Table[a[n], {n, 1, 12}] (* G. C. Greubel, Oct 19 2018 *)
Join[{1, 4}, NestList[#^2&, 4, 10]] (* Harvey P. Dale, Aug 26 2019 *)
PROG
(PARI) {a(n) = if(n==1, 1, if(n==2, 4, prod(j=1, n-1, a(j))))};
for(n=1, 10, print1(a(n), ", ")) \\ G. C. Greubel, Oct 19 2018
CROSSREFS
Sequence in context: A019062 A019013 A340425 * A051460 A191972 A101407
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Sep 17 2009
STATUS
approved