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
%I A025585
%S A025585 1,4,66,2416,156190,15724248,2275172004,447538817472,114890380658550,
%T A025585 37307713155613000,14950368791471452636,7246997577257618116704,
%U A025585 4179647109945703200884716,2828559673553002161809327536
%N A025585 Central Eulerian numbers A(2n-1, n).
%D A025585 R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, 
               Reading, MA, 1990, p. 254.
%D A025585 B. Sturmfels, Solving Systems of Polynomial Equations, Amer. Math. Soc., 
               2002, see p 27 (is that the same sequence?)
%H A025585 David H. Bailey and Jonathan M. Borwein, <a href="http://www.carma.newcastle.edu.au/
               ~jb616/oscillatory.pdf">Experimental computation with oscillatory 
               integrals</a>, Comtemp. Math., to appear, 2009. [Added by njas, Nov 
               02 2009]
%F A025585 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.
%Y A025585 Cf. A008292.
%Y A025585 Sequence in context: A058438 A041119 A015475 this_sequence A048828 A003360 
               A083931
%Y A025585 Adjacent sequences: A025582 A025583 A025584 this_sequence A025586 A025587 
               A025588
%K A025585 nonn
%O A025585 1,2
%A A025585 David W. Wilson (davidwwilson(AT)comcast.net)

    
page 1

Search completed in 0.001 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 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research