|
| |
|
|
A010481
|
|
Decimal expansion of square root of 26.
|
|
5
| |
|
|
5, 0, 9, 9, 0, 1, 9, 5, 1, 3, 5, 9, 2, 7, 8, 4, 8, 3, 0, 0, 2, 8, 2, 2, 4, 1, 0, 9, 0, 2, 2, 7, 8, 1, 9, 8, 9, 5, 6, 3, 7, 7, 0, 9, 4, 6, 0, 9, 9, 5, 9, 6, 4, 0, 7, 5, 8, 4, 9, 7, 0, 8, 0, 4, 4, 2, 5, 9, 3, 3, 6, 3, 2, 0, 6, 2, 2, 2, 4, 1, 9, 5, 5, 8, 8, 3, 4, 8, 8, 5, 1, 0, 9, 3, 9, 3, 2, 0, 0
(list; constant; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Continued fraction expansion is 5 followed by {10} repeated. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 03 2009]
In the Gaussian moat problem, a moat of width sqrt(26) exists. [Paul Muljadi, Jan 28 2011]
|
|
|
REFERENCES
| Ellen Gethner, Stan Wagon and Brian Wick, A stroll through the Gaussian primes, American Mathematical Monthly 105 (1998), 327-337.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,20000
|
|
|
EXAMPLE
| 5.099019513592784830028224109022781989563770946099596407584970804425933... [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 03 2009]
|
|
|
MATHEMATICA
| RealDigits[N[Sqrt[26], 200]][[1]] (*From Vladimir Joseph Stephan Orlovsky, Feb 22 2011*)
|
|
|
PROG
| (PARI) { default(realprecision, 20080); x=sqrt(26); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b010481.txt", n, " ", d)); } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 03 2009]
|
|
|
CROSSREFS
| Cf. A040020 Continued fraction. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 03 2009]
Sequence in context: A200633 A196820 A176325 * A022898 A156550 A088307
Adjacent sequences: A010478 A010479 A010480 * A010482 A010483 A010484
|
|
|
KEYWORD
| nonn,cons
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
