login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024200 a(0) = 1, a(1) = 0, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1). 4
1, 0, 1, 2, 29, 156, 2661, 24198, 498105, 6440760, 156833865, 2638782090, 74441298645, 1544798322900, 49615408298925, 1225388793991950, 44177335967379825, 1265953302961023600, 50641025474398676625, 1652074847076051263250, 72631713568603890826125, 2658069269539881753055500 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

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,...

REFERENCES

A. E. Jolliffe, Continued Fractions, in Encyclopaedia Britannica, 11th ed., pp. 30-33; see p. 31.

FORMULA

A024199(n) + A024200(n) = A001147(n) = (2n-1)!! - Max Alekseyev (maxale(AT)gmail.com), Sep 23 2007.

A024199(n)/A024200(n) -> Pi/(4-Pi) as n -> oo. - Max Alekseyev (maxale(AT)gmail.com), Sep 23 2007.

CROSSREFS

Sequence in context: A062618 A128842 A028883 * A132412 A009772 A179024

Adjacent sequences:  A024197 A024198 A024199 * A024201 A024202 A024203

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Revised by N. J. A. Sloane (njas(AT)research.att.com), Jul 19 2002.

Initial terms changed by Max Alekseyev (maxale(AT)gmail.com), Sep 23 2007.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 16:32 EST 2012. Contains 205635 sequences.