Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050924
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A050924
%S A050924 0,1,2,9,1000000000
%N A050924 a(n) = (a(n-1)+1)^(a(n-1)), a(0) = 0.
%C A050924 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
%Y A050924 Cf. A109300, A109301.
%Y A050924 Sequence in context: A103562 A140319 A120314 this_sequence A096877 A058297 
               A113160
%Y A050924 Adjacent sequences: A050921 A050922 A050923 this_sequence A050925 A050926 
               A050927
%K A050924 easy,nonn
%O A050924 0,3
%A A050924 Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 30 1999
%E A050924 The next term is approximately e * 10^9000000000, with nine place accuracy. 
               - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Nov 16 2006

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research