Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001696
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A001696 M1268 N0487
%S A001696 0,1,2,4,12,108,10476,108625644,11798392680793836,
%T A001696 139202068568601568785946949658348,
%U A001696 19377215893777651167043206536157529523359277782016064519251404524
%N A001696 a(n) = a(n-1)*(1+a(n-1)-a(n-2)), a(0) = 0, a(1) = 1.
%D A001696 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001696 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%H A001696 A. V. Aho and N. J. A. Sloane, <a href="http://www.research.att.com/~njas/
               doc/doubly.html">Some doubly exponential sequences</a>, Fib. Quart., 
               11 (1973), 429-437.
%H A001696 <a href="Sindx_Aa.html#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 
               + ...</a>
%o A001696 (PARI) a(n)=if(n<2,n>0,a(n-1)*(1+a(n-1)-a(n-2)))
%Y A001696 a(n)=A039941(2*n); first difference sequence of this sequence is A001697 
               - Michael Somos, May 19, 2000.
%Y A001696 Sequence in context: A053631 A120618 A038791 this_sequence A013333 A154882 
               A062000
%Y A001696 Adjacent sequences: A001693 A001694 A001695 this_sequence A001697 A001698 
               A001699
%K A001696 nonn,easy
%O A001696 0,3
%A A001696 N. J. A. Sloane (njas(AT)research.att.com).

    
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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research