login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165736 a(n) = n^n^n^n^n^n^n^n^n^n^... read mod 10^10. 1
1, 1432948736, 2464195387, 411728896, 8408203125, 7447238656, 1565172343, 9695225856, 7392745289, 0, 9172666611, 6254012416, 4655045053, 7567502336, 5380859375, 290415616, 5320085777, 5354315776, 609963179, 0, 4460652421, 2551504896, 1075718247, 1076734976 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Of course leading zeros are omitted.

a(3) gives the last 10 digits of Graham's number.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Galidakis, Ioannis and Weisstein, Eric W., Power Tower.

FORMULA

a(n) = n^(n^(n^(n^(n^(n^(n^(n^(n^(n^n mod 10) mod 100) mod 1000) mod 10000) mod 100000) mod 1000000) mod 10000000) mod 100000000) mod 1000000000) mod 10000000000.

EXAMPLE

3^3 mod 10 = 7; 3^7 mod 100 = 87; 3^87 mod 1000 = 387; 3^387 mod 10000 = 5387; 3^5387 mod 100000 = 95387; 3^95387 mod 1000000 = 195387; 3^195387 mod 10000000 = 4195387; 3^4195387 mod 100000000 = 64195387; 3^64195387 mod 1000000000 = 464195387; 3^464195387 mod 10000000000 = 2464195387; So the last 10 digits of 3^3^3^3^3^3^3^3^3^3^3^3^3^... are 2464195387 and a(3) = 2464195387.

MAPLE

a:= proc(n) local i, m; if irem (n, 10)=0 then 0 else m:= n; for i from 1 to 10 do m:= n&^m mod 10^i od; m fi end: seq (a(n), n=1..30); # Alois P. Heinz, Sep 28 2009

CROSSREFS

Sequence in context: A185931 A069320 A129249 * A048051 A073519 A166113

Adjacent sequences:  A165733 A165734 A165735 * A165737 A165738 A165739

KEYWORD

nonn,base

AUTHOR

Ivan Panchenko, Sep 25 2009

EXTENSIONS

Edited (but not checked) by N. J. A. Sloane, Sep 28 2009

Corrected and extended by Alois P. Heinz, Sep 28 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 21 23:48 EDT 2013. Contains 225505 sequences.