Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A053490
%S A053490 1,0,6,9,132,630,6642,55440,608976,6790392,85413960,1145077560,
%T A053490 16600386888,256806229680,4233767671728,74015194485960,1368023697469440,
%U A053490 26649263762049600,545697922821501888,11717708270380421760,263276186128105633920
%N A053490 E.g.f.: (1-x)^(-3x).
%D A053490 R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see 
               Example 5.2.3.
%F A053490 a(n) = (-1)^n*Sum_{k=0..floor(n/2)} 3^k*binomial(n, k)*k!*Stirling1(n-k, 
               k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 19 2004
%Y A053490 A007113, A053489.
%Y A053490 Sequence in context: A103107 A121233 A156180 this_sequence A061110 A110460 
               A159190
%Y A053490 Adjacent sequences: A053487 A053488 A053489 this_sequence A053491 A053492 
               A053493
%K A053490 nonn
%O A053490 0,3
%A A053490 N. J. A. Sloane (njas(AT)research.att.com), Jan 15 2000

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research