|
Search: id:A060158
|
|
|
| A060158 |
|
Number of permutations of [n] with 4 sequences. |
|
+0
4
|
|
| 0, 0, 0, 0, 0, 32, 300, 1852, 9576, 45096, 201060, 866324, 3650592, 15154240, 62260380, 253939116, 1030367448, 4165106264, 16790875860, 67553807428, 271383782544, 1089035545968, 4366631897100, 17497971562460, 70086163646280, 280627369334152, 1123357369925700
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 261.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,200
E. Rodney Canfield and Herbert S. Wilf, Counting permutations by their runs up and down [See u_4.]
|
|
FORMULA
|
a(n) = 2n-7+(6-n)2^(n-1)-3^n+4^(n-1).
G.f.: 4*x^5*(8-29*x+24*x^2)/((1-4*x)*(1-3*x)*(1-2*x)^2*(1-x)^2).
|
|
MAPLE
|
n4 := n->2*n-7+(6-n)*2^(n-1)-3^n+4^(n-1); seq(n4(i), i=5..27);
|
|
PROGRAM
|
(PARI) { for (n=0, 200, if (n<2, a=0, a=2*n - 7 + (6 - n)*2^(n - 1) - 3^n + 4^(n - 1)); write("b060158.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 02 2009]
|
|
CROSSREFS
|
Cf. A028399, A060157, A000486, A059427, A000352, A123003.
Sequence in context: A126527 A122103 A009526 this_sequence A074469 A159654 A061958
Adjacent sequences: A060155 A060156 A060157 this_sequence A060159 A060160 A060161
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Barbara Haas Margolius (margolius(AT)math.csuohio.edu) 3/12/01
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 11 2006
|
|
|
Search completed in 0.002 seconds
|
