%I #16 Nov 30 2021 12:20:45
%S 1,10,10,100,10000,100000000,10000000000000000,
%T 100000000000000000000000000000000,
%U 10000000000000000000000000000000000000000000000000000000000000000
%N a(1) = 1, a(2) = 10; thereafter a(n) = Product_{1 <= i <= n-1} a(i).
%H G. C. Greubel, <a href="/A165428/b165428.txt">Table of n, a(n) for n = 1..12</a>
%F a(n) = 10^(2^(n-3)) = A011557(2^(n-3)) = 10^A000079(n-3).
%F a(1) = 1, a(2) = 10, a(3) = 10, and for n > 3 a(n) = (a(n-1))^2.
%t a[1] = 1; a[2] = 10; a[n_] := Times @@ Array[a, n - 1]; Array[a, 9] (* _Robert G. Wilson v_, Oct 13 2009 *)
%t Join[{1,10},NestList[#^2&,10,10]] (* _Harvey P. Dale_, Nov 30 2021 *)
%o (PARI) {a(n) = if(n==1, 1, if(n==2, 10, prod(j=1,n-1, a(j))))};
%o for(n=1,10, print1(a(n), ", ")) \\ _G. C. Greubel_, Oct 19 2018
%K nonn
%O 1,2
%A _Jaroslav Krizek_, Sep 17 2009
%E Name changed, formula edited by _Robert G. Wilson v_, Oct 13 2009
%E Edited by _N. J. A. Sloane_, Oct 15 2009