|
Search: id:A050924
|
|
|
| A050924 |
|
a(n) = (a(n-1)+1)^(a(n-1)), a(0) = 0. |
|
+0
16
|
| |
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Let S(1) c S(2) c ... c S(n) c ... be an increasing sequence of sets of partial functions that is defined as follows: S(0) = empty set, S(n) = {partial functions: S(n-1) -> S(n-1)}. Then |S(n)| = a(n). - Jon Awbrey (jawbrey(AT)att.net), Jul 04 2005
|
|
CROSSREFS
|
Cf. A109300, A109301.
Sequence in context: A103562 A140319 A120314 this_sequence A096877 A058297 A113160
Adjacent sequences: A050921 A050922 A050923 this_sequence A050925 A050926 A050927
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 30 1999
|
|
EXTENSIONS
|
The next term is approximately e * 10^9000000000, with nine place accuracy. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Nov 16 2006
|
|
|
Search completed in 0.002 seconds
|
