Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002674
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002674 (2*n)!/2.
(Formerly M4879 N2092)
+0
4
1, 12, 360, 20160, 1814400, 239500800, 43589145600, 10461394944000, 3201186852864000, 1216451004088320000, 562000363888803840000, 310224200866619719680000, 201645730563302817792000000, 152444172305856930250752000000, 132626429906095529318154240000000 (list; graph; listen)
OFFSET

1,2

COMMENT

Right side of the binomial sum n-> sum( (-1)^i * (n-i)^(2*n) * binomial(2*n, i), i=0..n) - Yong Kong (ykong(AT)curagen.com), Dec 28 2000

REFERENCES

A. P. Prudnikov, Yu. A. Brychkov, and O.I. Marichev, "Integrals and Series", Volume 1: "Elementary Functions", Chapter 4: "Finite Sums", New York, Gordon and Breach Science Publishers, 1986-1992, Eq. (4.2.2.33)

H. E. Salzer, Tables of coefficients for obtaining central differences from their derivatives, Journal of Mathematics and Physics, 42 (1963), 162-165.

FORMULA

4*sinh(x/2)^2 = sum(k>=1, x^(2k)/a(k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 08 2002

E.g.f.: (hypergeom([1/2, 1], [], 4*x)-1)/2 (cf. A090438).

CROSSREFS

a(n)=A090438(n, 2), n>=1 (first column of (4, 2)-Stirling2 array).

Adjacent sequences: A002671 A002672 A002673 this_sequence A002675 A002676 A002677

Sequence in context: A012384 A012429 A012631 this_sequence A012552 A012385 A012430

KEYWORD

nonn,easy

AUTHOR

njas, Simon Plouffe (simon.plouffe(AT)gmail.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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research