A124075 - OEIS

This site is supported by donations to The OEIS Foundation.

A124075

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

2, 8, 2417851639229258349412352 (list; graph; refs; listen; history; internal format)

	OFFSET	`2,1`
	COMMENTS	`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 * A019315 A127558 A197294` `Adjacent sequences: A124072 A124073 A124074 * 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`

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

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.