This site is supported by donations to The OEIS Foundation.
Graham's number
From OeisWiki
G |
where the number of arrows in each layer, starting at the top layer, is specified by the value of the next layer below it; that is,
and where a superscript on an up-arrow indicates how many arrows there are.
Notice that
where the number of 3s in the expression on the RHS is 3 ↑↑ (3 ↑↑ 3), and 3 ↑↑ 3 = 7625597484987.
Sequences
A014222a (0) = 0 |
a (n + 1) = 3 a (n) |
- {0, 1, 3, 27, 7625597484987, ...}
Notes
- ↑ https://cseweb.ucsd.edu/~rgraham/
- ↑ Weisstein, Eric W., Graham's Number, from MathWorld—A Wolfram Web Resource.
- ↑ Sequence of the Day for September 2
References
- Gardner, Martin (November 1977). “Mathematical Games”. Scientific American 237: pp. 18–28 .; reprinted (revised) in Gardner (2001), cited below.
- Gardner, Martin (2001). The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems. New York, NY: Norton. ISBN 0-393-02023-1.