|
| |
|
|
A105927
|
|
Let d(n) = A000166(n); then a(n) = (n^2+n-1)*d(n) + (-1)^(n-1)*(n-1).
|
|
1
| |
|
|
0, 0, 2, 12, 84, 640, 5430, 50988, 526568, 5940576, 72755370, 961839340, 13656650172, 207316760352, 3351430059614, 57487448630220, 1042952206111440, 19954639072648768, 401578933206288978, 8480263630552747596, 187505565234912994340, 4332318322289242716480
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Number of permutations p of [n] such that p(k) = k+2 for exactly two k in the range 0<k<n-1, (offset 2). - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 14 2007
|
|
|
REFERENCES
| P. A. MacMahon, Combinatory Analysis, 2 vols., Chelsea, NY, 1960, see p. 108.
|
|
|
CROSSREFS
| Cf. A055790, A018934, A000153.
Sequence in context: A136278 A130464 A006657 * A052887 A052867 A179495
Adjacent sequences: A105924 A105925 A105926 * A105928 A105929 A105930
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Apr 27 2005
|
| |
|
|
