|
%I #22 Aug 21 2023 12:33:15
%S 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,
%T 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,
%U 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
%N Decimal expansion of square root of 26.
%C Continued fraction expansion is 5 followed by {10} repeated. - _Harry J. Smith_, Jun 03 2009
%C In the Gaussian moat problem, a moat of width sqrt(26) exists. - _Paul Muljadi_, Jan 28 2011
%H Harry J. Smith, <a href="/A010481/b010481.txt">Table of n, a(n) for n = 1..20000</a>
%H Ellen Gethner, Stan Wagon and Brian Wick, <a href="http://mathdl.maa.org/images/upload_library/22/Chauvenet/Gethner.pdf">A stroll through the Gaussian primes</a>, American Mathematical Monthly 105 (1998), 327-337.
%H <a href="/index/Al#algebraic_02">Index entries for algebraic numbers, degree 2</a>
%e 5.09901951359278483002822410902278198956377094609959640758497080442...
%t RealDigits[N[Sqrt[26], 200]][[1]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 22 2011 *)
%o (PARI) default(realprecision, 20080); x=sqrt(26); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b010481.txt", n, " ", d)); \\ _Harry J. Smith_, Jun 03 2009
%Y Cf. A040020 (continued fraction).
%K nonn,cons
%O 1,1
%A _N. J. A. Sloane_
|
