|
Search: id:A080984
|
|
|
| A080984 |
|
Define b by b(1) = 1, and for n>1, b(n) = b(n-1)+1/(2+1/b(n-1)); sequence gives numerator of b(n). |
|
+0
3
|
|
| 1, 4, 56, 9968, 294115808, 242590126064151488, 158248601344912132157178428071499648, 65129411362626329768830076910903417752818896343320137665280356705971968
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Suggested by Leroy Quet (qq-quet(AT)mindspring.com), Feb 26 2003.
|
|
FORMULA
|
b[k]=n[k]/d[k]; n[1]=1, d[1]=1, m=2; for k>=2: n[k+1] = n[k] *(m*n[k] + 2*d[k]), d[k+1] = d[k] *(m*n[k] + d[k]) (Leroy Quet)
|
|
EXAMPLE
|
The sequence begins 1, 4/3, 56/33, 9968/4785, 294115808/118289985, ...
|
|
PROGRAM
|
Reduce: a := 1; for i := 1:8 do write a := a+1/(2+1/a);
|
|
CROSSREFS
|
Cf. A080985, A080986, A080987, A079269, A079278.
Sequence in context: A070019 A056075 A000315 this_sequence A071579 A060497 A092273
Adjacent sequences: A080981 A080982 A080983 this_sequence A080985 A080986 A080987
|
|
KEYWORD
|
frac,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Feb 26 2003
|
|
|
Search completed in 0.002 seconds
|
