cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A014222 a(0) = 0; thereafter a(n+1) = 3^a(n).

Original entry on oeis.org

0, 1, 3, 27, 7625597484987
Offset: 0

Views

Author

Keywords

Comments

Alternative definition:
a(n+1) = H_4(3,n) the tetration (repeated exponentiation) of 3 times n.
For definition of and references concerning H_n(x,y) see A054871.
Next term is 12580...39387 and has 3638334640025 digits. - Shawn Ligocki (sligocki(AT)gmail.com), Oct 08 2009

Examples

			a(0) = H_4(3,-1)= 0;
a(1) = H_4(3,0) = 1;
a(2) = H_4(3,1) = 3;
a(3) = H_4(3,2) = 3^3 = 27;
a(4) = H_4(3,3) = 3^3^3 = 7625597484987;
a(5) = H_4(3,4) = 3^3^3^3 = 3^7625597484987 > 10^3638334640025.
		

Crossrefs

Cf. A014221 (a(n+1) = 2^a(n), or H_4(2,n)), A081651, A114561, A266199 (H_5(3,n)).

Programs

Formula

a(n+1) = H_4(3,n) = 3^^n;
a(0) = 0, a(1) = 1, a(n+1) = 3^3^...^3 (n times).

Extensions

Revised using hyperoperation notation by Natan Arie Consigli, Jan 16 2016