|
Search: id:A008970
|
|
|
| A008970 |
|
Triangle T(n,k) = P(n,k)/2, n >= 2, 1<=k<n, of one-half of number of permutations of 1..n such that the differences have k runs with the same signs. |
|
+0
10
|
|
| 1, 1, 2, 1, 6, 5, 1, 14, 29, 16, 1, 30, 118, 150, 61, 1, 62, 418, 926, 841, 272, 1, 126, 1383, 4788, 7311, 5166, 1385, 1, 254, 4407, 22548, 51663, 59982, 34649, 7936, 1, 510, 13736, 100530, 325446, 553410, 517496, 252750, 50521, 1, 1022, 42236
(list; table; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 261, #13, P_{n,k}.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 260, Table 7.2.1.
|
|
LINKS
|
M. Bona and R. Ehrenborg, [math/9902020] A combinatorial proof of the log-concavity of the numbers of permutations with k runs
|
|
FORMULA
|
Let P(n, k) = number of permutations of [1..n] with k "sequences". Note that A008970 gives P(n, k)/2. Then g.f.: Sum_{n, k} P(n, k)*u^k*t^n/n! = (1+u)^(-1)*((1-u)*(1-sin(v+t*cos(v))-1) where u = sin v.
P(n, 1)=2, P(n, k) = k*P(n-1, k) + 2*P(n-1, k-1) + (n-k)*P(n-1, k-2).
|
|
EXAMPLE
|
1; 1,2; 1,6,5; 1,14,29,16; ...
|
|
CROSSREFS
|
Diagonals give A000352, A000486, A000506, A000111, A000708, A091303. A059427 gives triangle of P(n, k).
Adjacent sequences: A008967 A008968 A008969 this_sequence A008971 A008972 A008973
Sequence in context: A066654 A108767 A046817 this_sequence A055896 A116395 A133367
|
|
KEYWORD
|
tabl,nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Feb 01 2001
|
|
|
Search completed in 0.002 seconds
|
