|
Search: id:A129535
|
|
|
| A129535 |
|
Number of permutations of 1,...,n with at least one pair of adjacent consecutive entries (i.e. of the form k(k+1) or (k+1)k; n>=2). |
|
+0
2
|
|
| 2, 6, 22, 106, 630, 4394, 35078, 315258, 3149494, 34620010, 415222566, 5395737242, 75516784982, 1132471183626, 18115911832390, 307919970965434, 5541804787940598, 105282261866132138, 2105441434230129254
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
Column 1 of A129534. a(n)=n! - A002464(n).
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 6.40.
|
|
FORMULA
|
G.f.=E(x)-E(x(1-x)/(1+x)), where E(x)=Sum(n!x^n, n>=0).
|
|
EXAMPLE
|
a(4)=22 because 3142 and 2413 are the only permutations of 1,2,3,4 with no adjacent consecutive entries.
|
|
MAPLE
|
E:=x->sum(n!*x^n, n=0..35): G:=E(x)-E(x*(1-x)/(1+x)): Gser:=series(G, x=0, 30): seq(coeff(Gser, x, n), n=2..23);
|
|
CROSSREFS
|
Cf. A129534, A002464.
Sequence in context: A129815 A103941 A064643 this_sequence A014371 A111280 A095817
Adjacent sequences: A129532 A129533 A129534 this_sequence A129536 A129537 A129538
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), May 05 2007
|
|
|
Search completed in 0.002 seconds
|
