|
Search: id:A053489
|
|
| |
|
| 1, 0, 4, 6, 64, 300, 2568, 20160, 193856, 1989792, 22687200, 279956160, 3737966208, 53589444480, 821522026752, 13407498599040, 232106716968960, 4248256958023680, 81968803604600832, 1662870215019018240, 35384007384670648320, 788053048823608565760
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.3.
|
|
FORMULA
|
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
|
|
CROSSREFS
|
A007113, A053490.
Sequence in context: A058162 A132929 A154668 this_sequence A012898 A013080 A013128
Adjacent sequences: A053486 A053487 A053488 this_sequence A053490 A053491 A053492
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 15 2000
|
|
|
Search completed in 0.002 seconds
|
