Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124075
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124075 a(n) = 2^(3^(4^...^n)...). +0
3
2, 8, 2417851639229258349412352 (list; graph; listen)
OFFSET

2,1

COMMENT

The next term is too large to include.

REFERENCES

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons, Problem 11286, Amer. Math. Monthly, 116 (2009) 466-467.

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, in "The Mathematics of Preference, Choice and Order: Essays in Honor of Peter Fishburn", edited by Steven Brams, William V. Gehrlein and Fred S. Roberts, Springer, 2009, pp. 393-402.

LINKS

David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing (arXiv:math.NT/0611293).

EXAMPLE

a(4) = 2^(3^4)) = 2417851639229258349412352.

CROSSREFS

Cf. A014221, A049384, A121263, A121265, A121295, A121296.

Sequence in context: A012672 A024340 A012667 this_sequence A019315 A127558 A011063

Adjacent sequences: A124072 A124073 A124074 this_sequence A124076 A124077 A124078

KEYWORD

nonn,bref

AUTHOR

David Applegate (david(AT)research.att.com) and N. J. A. Sloane (njas(AT)research.att.com), Nov 08 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research