login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050924 a(n) = (a(n-1)+1)^(a(n-1)), a(0) = 0. 15
0, 1, 2, 9, 1000000000 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

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 * A181500 A189876 A189867

Adjacent sequences:  A050921 A050922 A050923 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.