A214024 Decimal expansion of 4^4^4.

1, 3, 4, 0, 7, 8, 0, 7, 9, 2, 9, 9, 4, 2, 5, 9, 7, 0, 9, 9, 5, 7, 4, 0, 2, 4, 9, 9, 8, 2, 0, 5, 8, 4, 6, 1, 2, 7, 4, 7, 9, 3, 6, 5, 8, 2, 0, 5, 9, 2, 3, 9, 3, 3, 7, 7, 7, 2, 3, 5, 6, 1, 4, 4, 3, 7, 2, 1, 7, 6, 4, 0, 3, 0, 0, 7, 3, 5, 4, 6, 9, 7, 6, 8, 0, 1, 8, 7, 4, 2, 9, 8, 1, 6, 6, 9, 0, 3, 4, 2, 7, 6, 9, 0, 0

Offset

155,2

Comments

The same as 2^512. In this capacity, a floating point approximation is often casually given in computer programming textbooks (like the Hunt & Thomas) as an example where overflow is risked, and that risk is at times overcome, at others incurred.

3^3^3 = 7625597484987 (see A002488) while 5^5^5 is approximately 1.9110125979457752 * 10^2184.

References

Andrew Hunt & David Thomas, The Pragmatic Programmer: From Journeyman to Master. New York: Addison-Wesley Longman (2000): 195, the fourth new element added to the object testData in the source code listing.

Links

T. D. Noe, Table of n, a(n) for n = 155..309 (complete sequence)

Example

4^4^4 = 1.3407807929942597... * 10^154

Mathematica

IntegerDigits[4^4^4]

Prog

(PARI) 4^4^4 \\ Charles R Greathouse IV, Aug 21 2015

Crossrefs

Cf. A169685, A117853, A193864, A054382 (number of digits in n^n^n).

Sequence in context: A092894 A276563 A011338 * A215079 A049251 A308642

Adjacent sequences: A214021 A214022 A214023 * A214025 A214026 A214027

Keyword

nonn,cons,fini,full,easy

Author

Alonso del Arte, Jul 01 2012

Status

approved