|
|
|
|
|
|
|
|
|
#7 by Michael De Vlieger at Thu Dec 08 20:46:18 EST 2022
|
|
|
|
|
|
|
|
#6 by Kevin Ryde at Thu Dec 08 18:55:07 EST 2022
|
|
|
|
|
|
|
|
#5 by Kevin Ryde at Thu Dec 08 18:54:56 EST 2022
|
|
| CROSSREFS
|
Cf. A049384, A358972 (exponents left to right).
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#4 by Russ Cox at Fri Mar 30 18:51:38 EDT 2012
|
|
| EXTENSIONS
|
Edited by _Henry Bottomley (se16(AT)btinternet.com), _, Jul 13 2003
|
|
|
|
|
Discussion
|
| Fri Mar 30
| 18:51
| OEIS Server: https://oeis.org/edit/global/247
|
|
|
|
|
|
|
#3 by N. J. A. Sloane at Tue Jan 24 03:00:00 EST 2006
|
|
| KEYWORD
|
easy,nonn,new
|
|
| EXTENSIONS
|
Edited by Henry Bottomley (se16(AT)btinterentbtinternet.com), Jul 13 2003
|
|
|
|
|
|
|
#2 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
|
|
| NAME
|
A function based on a factorial recursively exponentiated.
Factorials successively exponentiated.
|
|
| COMMENTS
|
A sequence I found playing with exponents and recursion. Generates big numbers fast, for a(5) Mathematica returns an overflow error.
a(5) > 10^(10^50).
|
|
| FORMULA
|
a(0) = 1; a(n) = n!^a(n - 1) starting with a(0)=0!=1).
|
|
| EXAMPLE
|
a(3) = 36 because 3!^!^(2!^!^(1!^1 = 0!)) = 36
|
|
| KEYWORD
|
easy,nonn,uned,new
|
|
| EXTENSIONS
|
Edited by Henry Bottomley (se16(AT)btinterent.com), Jul 13 2003
|
|
|
|
|
|
|
#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
|
|
| NAME
|
A function based on a factorial recursively exponentiated.
|
|
| DATA
|
1, 1, 2, 36, 48708493958471199415506599153950129703565945470976
|
|
| OFFSET
|
0,3
|
|
| COMMENTS
|
A sequence I found playing with exponents and recursion. Generates big numbers fast, for a(5) Mathematica returns an overflow error.
|
|
| FORMULA
|
a(0) = 1; a(n) = n!^a(n - 1)
|
|
| EXAMPLE
|
a(3) = 36 because 3!^2!^1!^1 = 36
|
|
| MATHEMATICA
|
a[0] := 1 a[n_Integer] := n!^a[n - 1]
|
|
| KEYWORD
|
easy,nonn,uned
|
|
| AUTHOR
|
Jon Kongsvold (Jon.Kongsvold(AT)idi.ntnu.no), Aug 28 2002
|
|
| STATUS
|
approved
|
|
|
|
|
|