This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A322142 Powernacci numbers: a(n) = 2^(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1. 1
 0, 1, 2, 8, 1024 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(5) = 4.602094... * 10^310, a(6) = 1.734184... * 10^(1.385368... * 10^310). - Amiram Eldar, Dec 12 2018 LINKS Francois Alcover, Table of n, a(n) for n = 0..5 EXAMPLE a(0) = 0. a(1) = 1. a(2) = 2^(0+1) = 2. a(3) = 2^(1+2) = 8. MATHEMATICA a = 0; a = 1; a[n_] := a[n] = 2^(a[n-2] + a[n-1]); Array[a, 6, 0] (* Amiram Eldar, Dec 12 2018 *) CROSSREFS Cf. A000045. Sequence in context: A282890 A004491 A132573 * A061591 A103085 A084148 Adjacent sequences:  A322139 A322140 A322141 * A322143 A322144 A322145 KEYWORD nonn AUTHOR Francois Alcover, Dec 11 2018 STATUS approved

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

Last modified October 23 11:48 EDT 2019. Contains 328345 sequences. (Running on oeis4.)