login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A287328 Number of permutations of [n] with exactly n (possibly overlapping) occurrences of the generalized pattern 13-2 (alternatively: 2-13, 2-31, or 31-2). 2
1, 0, 0, 0, 0, 0, 2, 42, 716, 11115, 166144, 2440438, 35573362, 517145226, 7517489564, 109427233994, 1596263948916, 23344423478564, 342325226476816, 5033781463313268, 74223067319020872, 1097343555359525542, 16265399526715750734, 241690082996256941332 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
COMMENTS
Also number of permutations of [n] with n nestings; also number of permutations of [n] with n crossings.
LINKS
FORMULA
a(n) = A263776(n,n).
MAPLE
b:= proc(u, o) option remember;
`if`(u+o=0, 1, add(b(u-j, o+j-1), j=1..u)+
add(expand(b(u+j-1, o-j)*x^(j-1)), j=1..o))
end:
a:= n-> coeff(b(n, 0), x, n):
seq(a(n), n=0..30);
MATHEMATICA
b[u_, o_] := b[u, o] = If[u + o == 0, 1, Sum[b[u - j, o + j - 1], {j, 1, u}] + Sum[Expand[b[u + j - 1, o - j]*x^(j - 1)], {j, 1, o}]];
a[n_] := Coefficient[b[n, 0], x, n];
Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Dec 06 2023, after Alois P. Heinz *)
CROSSREFS
Main diagonal of A263776.
Sequence in context: A140170 A318247 A038396 * A276923 A308526 A162678
KEYWORD
nonn,changed
AUTHOR
Alois P. Heinz, Aug 31 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 13:48 EST 2023. Contains 367691 sequences. (Running on oeis4.)