A049384 - OEIS

This site is supported by donations to The OEIS Foundation.

A049384

a(0)=1, a(n+1)=(n+1)^a(n)

1, 1, 2, 9, 262144 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	COMMENTS	`An "exponential factorial".` `Might also be called the "expofactorial" of n. - Walter Arrighetti (walter.arrighetti(AT)fastwebnet.it), Jan 16 2006` `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).` `Walter Arrighetti, LabCEM, Department of Electronic Engineering, Univ. degli Studi di Roma "La Sapienza".` `Walter Arrighetti, Double Vision [Broken link?]` `Vladimir Orlovsky, Very Big Number, Feb 19 1999` `Eric Weisstein's World of Mathematics, Exponential Factorial`
	EXAMPLE	`a(4) = 4^9 = 262144.` `a(5) = 5^262144 has 183231 decimal digits. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Feb 15 2002`
	MATHEMATICA	`Expofactorial[0]:=1; Expofactorial[n_Integer]:=n^Expofactorial[n-1]; (Arrighetti)`
	CROSSREFS	`Cf. A000142.` `Sequence in context: A028581 A030252 * A132859 A103562 A140319 A120314` `Adjacent sequences: A049381 A049382 A049383 * A049385 A049386 A049387`
	KEYWORD	`nonn`
	AUTHOR	`Marcel Jackson (Marcel.Jackson(AT)utas.edu.au)`

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

Last modified February 14 10:43 EST 2012. Contains 205614 sequences.