%I A040217
%S A040217 15,3,1,3,1,1,1,1,3,1,3,30,3,1,3,1,1,1,1,3,1,3,30,3,1,3,1,1,1,1,
%T A040217 3,1,3,30,3,1,3,1,1,1,1,3,1,3,30,3,1,3,1,1,1,1,3,1,3,30,3,1,3,1,
%U A040217 1,1,1,3,1,3,30,3,1,3,1,1,1,1,3,1,3,30,3,1,3,1,1,1,1,3,1,3,30,3
%N A040217 Continued fraction for sqrt(233).
%H A040217 <a href="Sindx_Con.html#confC">Index entries for continued fractions
for constants</a>
%F A040217 a(n)=(1/605)*{-1437*(n mod )-62*[(n+1) mod 11]+158*[(n+2) mod 11]-62*[(n+3)
mod 11]+48*[(n+4) mod 11]+48*[(n+5) mod 11]+48*[(n+6) mod 11]+158*[(n+7)
mod 11]-62*[(n+8) mod 11]+158*[(n+9) mod 11]+1533*[(n+10) mod 11]}-15*[C(2*n,
n) mod 2], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Apr 23
2009]
%p A040217 with(numtheory): Digits := 300: convert(evalf(sqrt(233)),confrac);
%Y A040217 Sequence in context: A040223 A076595 A040224 this_sequence A040218 A037924
A040219
%Y A040217 Adjacent sequences: A040214 A040215 A040216 this_sequence A040218 A040219
A040220
%K A040217 nonn,cofr,easy
%O A040217 0,1
%A A040217 N. J. A. Sloane (njas(AT)research.att.com).
|