STATUS
reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
editing
approved
PellSolve[(m_Integer)?Positive] := Module[{cf, n, s}, cf = ContinuedFraction[ Sqrt[m]]; n = Length[ Last[cf]]; If[ OddQ[n], n = 2*n]; s = FromContinuedFraction[ ContinuedFraction[ Sqrt[m], n]]; {Numerator[s], Denominator[s]}]; Transpose[ PellSolve /@ Select[ Prime[ Range[72]], Mod[ #, 4] == 3 &]][[1]] (from * _Robert G. Wilson v _, Sep 02 2004 *)
N. J. A. Sloane, Apr 18, 2003
approved
editing
proposed
approved
editing
proposed
Vincenzo Librandi, <a href="/A081231/b081231.txt">Table of n, a(n) for n = 1..1000</a>
approved
editing
More terms from _Robert G. Wilson v (rgwv(AT)rgwv.com), _, Sep 02 2004