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
A024200 a(0) = 1, a(1) = 0, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1). +0
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; listen)
OFFSET

0,4

COMMENT

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 this_sequence A132412 A009772 A020460

Adjacent sequences: A024197 A024198 A024199 this_sequence 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.

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research