|
Search: id:A003687
|
|
|
| A003687 |
|
a(n+1)=a(n)-a(1)a(2)...a(n-1), if n>0. a(0)=1,a(1)=2. |
|
+0
4
|
|
| 1, 2, 1, -1, -3, -1, -7, -1, -43, -1, -1807, -1, -3263443, -1, -10650056950807, -1, -113423713055421844361000443, -1, -12864938683278671740537145998360961546653259485195807, -1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n)=a(n-1)-a(n-2)^2+a(n-1)*a(n-2), if n>2. - Michael Somos Mar 19 2004
Consider the mapping f(a/b) = (a - b)/(ab). Taking a = 2 b = 1 to start with, and carrying out this mapping repeatedly on each new (reduced) rational number gives the following sequence 2/1,1/2,-1/2,-3/-2,-1/6,... Sequence contains the numerators. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 24 2003
An infinite coprime sequence defined by recursion. - Michael Somos Mar 19 2004
|
|
PROGRAM
|
(PARI) a(n)=local(an); if(n<1, (n==0), an=vector(max(2, n)); an[1]=2; an[2]=1; for(k=3, n, an[k]=an[k-1]-an[k-2]^2+an[k-1]*an[k-2]); an[n])
|
|
CROSSREFS
|
Cf. A081478.
For n>1, a(2n-1) = -1, a(2n) = -A007018(n-1) - 1.
Adjacent sequences: A003684 A003685 A003686 this_sequence A003688 A003689 A003690
Sequence in context: A052920 A089141 A081477 this_sequence A104575 A046223 A073463
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
