|
Search: id:A010030
|
|
|
| A010030 |
|
Triangle of permutations of 1..n by number of runs of consecutive pairs up and down (divided by 2). |
|
+0
3
|
|
| 1, 1, 0, 3, 0, 3, 8, 1, 25, 28, 7, 17, 155, 143, 45, 259, 1005, 933, 323, 131, 2770, 7488, 7150, 2621, 3177, 27978, 64164, 62310, 23811, 1281, 51433, 294602, 619986, 607445, 239653
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 264.
|
|
FORMULA
|
G.f. for number of permutations of 1..n by number of runs of consecutive pairs up and down is Sum(n!*(((1-y)*(2*x^2-x^3)-x)/((1-y)*x^2-1))^n,n = 0 .. infinity), cf. A010029. - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 23 2007
|
|
CROSSREFS
|
Cf. A002464, A001266, A000239, A000544, A001282.
Sequence in context: A021771 A154853 A139214 this_sequence A117940 A099093 A137339
Adjacent sequences: A010027 A010028 A010029 this_sequence A010031 A010032 A010033
|
|
KEYWORD
|
tabl,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 23 2007
|
|
|
Search completed in 0.002 seconds
|
