login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A238987
Number of permutations of length n containing exactly 1 occurrence of the pattern 1324.
0
0, 0, 0, 1, 10, 75, 522, 3579, 24670, 172198, 1219974, 8776255, 64082132, 474605417, 3562460562, 27079243352, 208281537572
OFFSET
1,5
REFERENCES
B. K. Nakamura, Computational methods in permutation patterns, PhD Dissertation, Rutgers University, May 2013.
LINKS
Fredrik Johansson, Brian Nakamura, Using functional equations to enumerate 1324-avoiding permutations, arXiv:1309.7117 [math.CO], (2013).
EXAMPLE
a(4)=1 since 1324 is the only length 4 permutation with 1 occurrence of the pattern 1324.
MAPLE
# Program can be obtained from authors' personal websites.
CROSSREFS
Sequence in context: A233657 A346842 A081017 * A357480 A271476 A025015
KEYWORD
nonn,more
AUTHOR
Brian Nakamura, Mar 12 2014
STATUS
approved