Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024200
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A024200
%S A024200 1,0,1,2,29,156,2661,24198,498105,6440760,156833865,2638782090,74441298645,
%T A024200 1544798322900,49615408298925,1225388793991950,44177335967379825,1265953302961023600,
%U A024200 50641025474398676625,1652074847076051263250,72631713568603890826125,2658069269539881753055500
%N A024200 a(0) = 1, a(1) = 0, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1).
%C A024200 a(n) = s(1)s(2)...s(n)(1/s(2) - 1/s(3) + ... + c/s(n)) where c=(-1)^n 
               and s(k) = 2k-1 for k = 1,2,3,...
%D A024200 A. E. Jolliffe, Continued Fractions, in Encyclopaedia Britannica, 11th 
               ed., pp. 30-33; see p. 31.
%F A024200 A024199(n) + A024200(n) = A001147(n) = (2n-1)!! - Max Alekseyev (maxale(AT)gmail.com), 
               Sep 23 2007.
%F A024200 A024199(n)/A024200(n) -> Pi/(4-Pi) as n -> oo. - Max Alekseyev (maxale(AT)gmail.com), 
               Sep 23 2007.
%Y A024200 Sequence in context: A062618 A128842 A028883 this_sequence A132412 A009772 
               A020460
%Y A024200 Adjacent sequences: A024197 A024198 A024199 this_sequence A024201 A024202 
               A024203
%K A024200 nonn
%O A024200 0,4
%A A024200 Clark Kimberling (ck6(AT)evansville.edu)
%E A024200 Revised by N. J. A. Sloane (njas(AT)research.att.com), Jul 19 2002.
%E A024200 Initial terms changed by Max Alekseyev (maxale(AT)gmail.com), Sep 23 
               2007.

    
page 1

Search completed in 0.005 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research