Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A053489
%S A053489 1,0,4,6,64,300,2568,20160,193856,1989792,22687200,279956160,3737966208,
%T A053489 53589444480,821522026752,13407498599040,232106716968960,4248256958023680,
%U A053489 81968803604600832,1662870215019018240,35384007384670648320,788053048823608565760
%N A053489 E.g.f.: (1-x)^(-2x).
%D A053489 R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see 
               Example 5.2.3.
%F A053489 a(n) = (-1)^n*Sum_{k=0..floor(n/2)} 2^k*binomial(n, k)*k!*Stirling1(n-k, 
               k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 19 2004
%Y A053489 A007113, A053490.
%Y A053489 Sequence in context: A058162 A132929 A154668 this_sequence A012898 A013080 
               A013128
%Y A053489 Adjacent sequences: A053486 A053487 A053488 this_sequence A053490 A053491 
               A053492
%K A053489 nonn
%O A053489 0,3
%A A053489 N. J. A. Sloane (njas(AT)research.att.com), Jan 15 2000

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research