|
Search: id:A006085
|
|
|
| A006085 |
|
Continued fraction for e/4.
(Formerly M1822)
|
|
+0
4
|
|
| 0, 1, 2, 8, 3, 1, 1, 1, 1, 7, 1, 1, 2, 1, 1, 1, 2, 7, 1, 2, 2, 1, 1, 1, 3, 7, 1, 3, 2, 1, 1, 1, 4, 7, 1, 4, 2, 1, 1, 1, 5, 7, 1, 5, 2, 1, 1, 1, 6, 7, 1, 6, 2, 1, 1, 1, 7, 7, 1, 7, 2, 1, 1, 1, 8, 7, 1, 8, 2, 1, 1, 1, 9, 7, 1, 9, 2, 1, 1, 1, 10, 7, 1, 10, 2, 1, 1, 1, 11, 7, 1, 11, 2, 1, 1, 1, 12, 7, 1, 12, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 2, p. 601.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,20000
G. Xiao, Contfrac
Index entries for continued fractions for constants
|
|
FORMULA
|
First seven terms are 0, 1, 2, 8, 3, 1, 1; then a(8k)=1, a(8k+1)=k, a(8k+2)=7, a(8k+3)=1, a(8k+4)=k, a(8k+5)=2, a(8k+6)=1, a(8k+7)=1. - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 08 2003
|
|
EXAMPLE
|
0.679570457114761308840071867... = 0 + 1/(1 + 1/(2 + 1/(8 + 1/(3 + ...)))) [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 10 2009]
|
|
PROGRAM
|
(PARI) { allocatemem(932245000); default(realprecision, 40000); x=contfrac(exp(1)/4); for (n=1, 20000, write("b006085.txt", n, " ", x[n])); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 10 2009]
|
|
CROSSREFS
|
Cf. A019741 = Decimal expansion. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), May 10 2009]
Sequence in context: A074723 A063077 A085192 this_sequence A021357 A016640 A083486
Adjacent sequences: A006082 A006083 A006084 this_sequence A006086 A006087 A006088
|
|
KEYWORD
|
nonn,cofr,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 20 2003
|
|
|
Search completed in 0.002 seconds
|
