Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A040250
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A040250
%S A040250 16,2,1,15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,32,2,1,
%T A040250 15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,
%U A040250 32,2,1,15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,32,2,1,15,1,2,32,2,1
%N A040250 Continued fraction for sqrt(267).
%H A040250 <a href="Sindx_Con.html#confC">Index entries for continued fractions 
               for constants</a>
%F A040250 a(n)=(1/90)*{-397*(n mod 6)+38*[(n+1) mod 6]+263*[(n+2) mod 6]-157*[(n+3) 
               mod 6]+68*[(n+4) mod 6]+503*[(n+5) mod 6]}-16*[C(2*n,n) mod 2], with 
               n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Apr 20 2009]
%p A040250 with(numtheory): Digits := 300: convert(evalf(sqrt(267)),confrac);
%Y A040250 Sequence in context: A095851 A095881 A040251 this_sequence A065645 A037925 
               A040252
%Y A040250 Adjacent sequences: A040247 A040248 A040249 this_sequence A040251 A040252 
               A040253
%K A040250 nonn,cofr,easy
%O A040250 0,1
%A A040250 N. J. A. Sloane (njas(AT)research.att.com).

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research