|
Search: id:A010467
|
|
|
| A010467 |
|
Decimal expansion of square root of 10. |
|
+0
6
|
|
| 3, 1, 6, 2, 2, 7, 7, 6, 6, 0, 1, 6, 8, 3, 7, 9, 3, 3, 1, 9, 9, 8, 8, 9, 3, 5, 4, 4, 4, 3, 2, 7, 1, 8, 5, 3, 3, 7, 1, 9, 5, 5, 5, 1, 3, 9, 3, 2, 5, 2, 1, 6, 8, 2, 6, 8, 5, 7, 5, 0, 4, 8, 5, 2, 7, 9, 2, 5, 9, 4, 4, 3, 8, 6, 3, 9, 2, 3, 8, 2, 2, 1, 3, 4, 4, 2, 4, 8, 1, 0, 8, 3, 7, 9, 3, 0, 0, 2, 9
(list; cons; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Continued fraction expansion is 3 followed by {6} repeated. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 02 2009]
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,20000
R. J. Nemiroff & J. Bonnell, The first 1 million digits of square root of 10
R. J. Nemiroff & J. Bonnell, Plouffe's Inverter, The first 1 million digits of square root of 10
|
|
FORMULA
|
Sqrt(10).
|
|
EXAMPLE
|
3.1622776601683793319988935444327185337195551...
3.162277660168379331998893544432718533719555139325216826857504852792594... [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 02 2009]
|
|
PROGRAM
|
(PARI) { default(realprecision, 20080); x=sqrt(10); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b010467.txt", n, " ", d)); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 02 2009]
|
|
CROSSREFS
|
Cf. A040006 Continued fraction. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 02 2009]
Sequence in context: A152193 A055151 A104573 this_sequence A158823 A122913 A069115
Adjacent sequences: A010464 A010465 A010466 this_sequence A010468 A010469 A010470
|
|
KEYWORD
|
nonn,cons
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
