|
| |
|
|
A092923
|
|
Number of permutations containing exactly one occurrence of the pattern #, with # one of {1-23, 3-21, 12-3, 32-1}.
|
|
0
| |
|
|
1, 7, 39, 211, 1168, 6728, 40561, 256297, 1696707, 11752973, 85047284, 641782220, 5041634549, 41160207335, 348664792199, 3059885806071, 27781291314396, 260599397789924, 2522492941426381
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,2
|
|
|
LINKS
| A. Claesson and T. Mansour, Counting patterns of type (1,2) or (2,1).
|
|
|
FORMULA
| G.f.: sum{n>=1, x/(1-nx) * sum{k>=0, kx^(k+n)/prod[l=1..k+n, 1-lx]}}.
Recurrence: a(n) = 2a(n-1) + sum{k=0..n-3, C(n-2, k)*[a(k+1)+B(k+1)]}, with B(n) the Bell numbers A000110(n).
|
|
|
PROG
| (PARI) a(n)=if(n<1, 0, 2*a(n-1)+sum(k=0, n-3, binomial(n-2, k)*(a(k+1)+polcoeff(serlaplace(exp(exp(x)-1)), k+1))))
|
|
|
CROSSREFS
| Sequence in context: A026708 A016127 A099460 * A164550 A125786 A155589
Adjacent sequences: A092920 A092921 A092922 * A092924 A092925 A092926
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Ralf Stephan, Apr 18 2004
|
| |
|
|
