|
Search: id:A006157
|
|
|
| A006157 |
|
a(n+1) = (n-1) a(n) +n.n!.
(Formerly M3950)
|
|
+0
5
|
|
| 1, 5, 28, 180, 1320, 10920, 100800, 1028160, 11491200, 139708800, 1836172800, 25945920000, 392302310400, 6320426112000, 108101081088000, 1956280854528000
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
Number of ascending runs of length at least two in all permutations of [n]. Example: a(3)=5 because we have (123), (13)2, 3(12), 2(13), (23)1 and 321, where the ascending runs of length at least 2 are shown between parentheses. - Emeric Deutsch and Ira Gessel (deutsch(AT)duke.poly.edu), Sep 07 2004
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. Francon, Histoires de fichiers, RAIRO Informatique Th\'{e}orique et Applications, 12 (1978), 49-62.
|
|
FORMULA
|
(2n-1)/6 * n!.
E.g.f. = x^2*(3-x)/[6(1-x)^2]. - Emeric Deutsch and Ira Gessel (deutsch(AT)duke.poly.edu), Sep 07 2004
|
|
CROSSREFS
|
Cf. A014484.
Sequence in context: A082031 A020081 A095676 this_sequence A156629 A123776 A070779
Adjacent sequences: A006154 A006155 A006156 this_sequence A006158 A006159 A006160
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
