|
| |
|
|
A010464
|
|
Decimal expansion of square root of 6.
|
|
17
| |
|
|
2, 4, 4, 9, 4, 8, 9, 7, 4, 2, 7, 8, 3, 1, 7, 8, 0, 9, 8, 1, 9, 7, 2, 8, 4, 0, 7, 4, 7, 0, 5, 8, 9, 1, 3, 9, 1, 9, 6, 5, 9, 4, 7, 4, 8, 0, 6, 5, 6, 6, 7, 0, 1, 2, 8, 4, 3, 2, 6, 9, 2, 5, 6, 7, 2, 5, 0, 9, 6, 0, 3, 7, 7, 4, 5, 7, 3, 1, 5, 0, 2, 6, 5, 3, 9, 8, 5, 9, 4, 3, 3, 1, 0, 4, 6, 4, 0, 2, 3
(list; constant; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Continued fraction expansion is 2 followed by {2, 4} repeated. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 05 2009]
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n = 1..20000
R. J. Nemiroff & J. Bonnell, Plouffe's Inverter, The first 1 million digits of the square root of 6
R. J. Nemiroff & J. Bonnell, The first 1 million digits of the square root of 6
|
|
|
EXAMPLE
| 2.449489742783178098197284074705891391965947480656670128432692567250960...
|
|
|
MATHEMATICA
| RealDigits[N[Sqrt[6], 200]][[1]] (*From Vladimir Joseph Stephan Orlovsky, Feb 20 2011*)
|
|
|
PROG
| (PARI) { default(realprecision, 20080); x=sqrt(6); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b010464.txt", n, " ", d)); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 01 2009]
|
|
|
CROSSREFS
| Cf. A040003 Continued fraction.
Sequence in context: A122033 A201777 A096189 * A187209 A006579 A195727
Adjacent sequences: A010461 A010462 A010463 * A010465 A010466 A010467
|
|
|
KEYWORD
| nonn,cons
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
