Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025585 Central Eulerian numbers A(2n-1, n). +0
1
1, 4, 66, 2416, 156190, 15724248, 2275172004, 447538817472, 114890380658550, 37307713155613000, 14950368791471452636, 7246997577257618116704, 4179647109945703200884716, 2828559673553002161809327536 (list; graph; listen)
OFFSET

1,2

REFERENCES

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 254.

B. Sturmfels, Solving Systems of Polynomial Equations, Amer. Math. Soc., 2002, see p 27 (is that the same sequence?)

LINKS

David H. Bailey and Jonathan M. Borwein, Experimental computation with oscillatory integrals, Comtemp. Math., to appear, 2009. [Added by njas, Nov 02 2009]

FORMULA

a(n)=sum((-1)^j*(n-j)^(2n-1)*binomial(2n, j), j=0..n). This is T(2n-1, n), where T(n, k) is given in A008292.

CROSSREFS

Cf. A008292.

Sequence in context: A058438 A041119 A015475 this_sequence A048828 A003360 A083931

Adjacent sequences: A025582 A025583 A025584 this_sequence A025586 A025587 A025588

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 December 6 19:58 EST 2009. Contains 170429 sequences.


AT&T Labs Research