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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097301 Numerators of rationals used in the Euler-Maclaurin type derivation of Stirling's formula for N!. 2
1, -1, 2, -3, 3360, -995040, 39916800, -656924748480, 1214047650816000, -169382556838010880, 15749593891765493760000, -4054844479616799289344000, 34017686450062663131463680000, -11402327189708082115897599590400000, 189528830020089532044244068728832000000 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Denominators are given in A097302.

The e.g.f. sum( A(2*n+1)*(x^(2*n+1))/(2*n+1)!,n=0..infinity) appears in the Stirling-formula derivation for N! with x=1/N in the exponent and the formula for A(2*n+1):=a(n)/A097302(n), n>=0, is given below. For Stirling's formula see A001163 and A001164.

The rationals A(2*n+1) = B(n):= (2*n)!*Bernoulli(2*(n+1))/(2*(n+1)) = a(n)/A097304(n) with A(2*n):=0 are the logarithmic transform of the rational sequence {A001163(n)/A001164(n)} (inverse of the sequence transform EXP)

REFERENCES

Julian Havil, Gamma, Exploring Euler's Constant, Princeton University Press, Princeton and Oxford, 2003, p. 87.

LINKS

W. Lang, More terms and comments.

N. J. A. Sloane, Transforms

FORMULA

a(n)=numerator(B(n)) with B(n):=Bernoulli(2*n+2)*(2*n)!/(2*n+2) and Bernoulli(n)= A027641(n)/A027642(n).

CROSSREFS

Sequence in context: A125612 A185156 A038104 * A020345 A085943 A068661

Adjacent sequences:  A097298 A097299 A097300 * A097302 A097303 A097304

KEYWORD

sign,frac,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Aug 13 2004

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 15 15:18 EST 2012. Contains 205823 sequences.