|
Search: id:A018934
|
|
|
| A018934 |
|
From the game of Mousetrap. |
|
+0
3
|
|
| 0, 0, 0, 2, 8, 42, 256, 1810, 14568, 131642, 1320128, 14551074, 174879880, 2276108362, 31894886208, 478775722802, 7664993150696, 130369025763930, 2347604596782208, 44619881467365442, 892659329531868168
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Number of permutations p of [n] such that p(k) = k+2 for exactly one k in the range 0<k<n-1. - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 30 2007
|
|
REFERENCES
|
Mundfrom, Daniel J.; A problem in permutations: the game of `Mousetrap'. European J. Combin. 15 (1994), no. 6, 555-560.
|
|
FORMULA
|
a(n) = (n-2)*A055790(n-2). E.g.f.: 2*x*exp(-x)/(1-x)^3. - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 30 2007
|
|
CROSSREFS
|
Cf. A002468.
Sequence in context: A120916 A133417 A100327 this_sequence A107588 A013999 A130649
Adjacent sequences: A018931 A018932 A018933 this_sequence A018935 A018936 A018937
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 30 2007, corrected Jan 25 2008
|
|
|
Search completed in 0.002 seconds
|
