login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165428 a(1) = 1, a(2) = 10; thereafter a(n) = Product_{1 <= i <= n-1} a(i). 3
1, 10, 10, 100, 10000, 100000000, 10000000000000000, 100000000000000000000000000000000, 10000000000000000000000000000000000000000000000000000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 10^(2^(n-3)) = A011557(2^(n-3)) = 10^A000079(n-3).
a(1) = 1, a(2) = 10, a(3) = 10, and for n > 3 a(n) = (a(n-1))^2.
MATHEMATICA
a[1] = 1; a[2] = 10; a[n_] := Times @@ Array[a, n - 1]; Array[a, 9] (* Robert G. Wilson v, Oct 13 2009 *)
Join[{1, 10}, NestList[#^2&, 10, 10]] (* Harvey P. Dale, Nov 30 2021 *)
PROG
(PARI) {a(n) = if(n==1, 1, if(n==2, 10, prod(j=1, n-1, a(j))))};
for(n=1, 10, print1(a(n), ", ")) \\ G. C. Greubel, Oct 19 2018
CROSSREFS
Sequence in context: A285613 A288301 A287602 * A288495 A288765 A287743
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Sep 17 2009
EXTENSIONS
Name changed, formula edited by Robert G. Wilson v, Oct 13 2009
Edited by N. J. A. Sloane, Oct 15 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)