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
A001696 a(n) = a(n-1)*(1+a(n-1)-a(n-2)), a(0) = 0, a(1) = 1.
(Formerly M1268 N0487)
+0
4
0, 1, 2, 4, 12, 108, 10476, 108625644, 11798392680793836, 139202068568601568785946949658348, 19377215893777651167043206536157529523359277782016064519251404524 (list; graph; listen)
OFFSET

0,3

LINKS

A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437.

Index entries for sequences of form a(n+1)=a(n)^2 + ...

PROGRAM

(PARI) a(n)=if(n<2, n>0, a(n-1)*(1+a(n-1)-a(n-2)))

CROSSREFS

a(n)=A039941(2*n); first difference sequence of this sequence is A001697 - Michael Somos, May 19, 2000.

Sequence in context: A053631 A120618 A038791 this_sequence A013333 A062000 A053040

Adjacent sequences: A001693 A001694 A001695 this_sequence A001697 A001698 A001699

KEYWORD

nonn,easy

AUTHOR

njas

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research