The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #25 Mar 14 2014 16:00:02
%S 0,0,0,1,10,75,522,3579,24670,172198,1219974,8776255,64082132,
%T 474605417,3562460562,27079243352,208281537572
%N Number of permutations of length n containing exactly 1 occurrence of the pattern 1324.
%D B. K. Nakamura, Computational methods in permutation patterns, PhD Dissertation, Rutgers University, May 2013.
%H Fredrik Johansson, Brian Nakamura, <a href="http://arxiv.org/abs/1309.7117">Using functional equations to enumerate 1324-avoiding permutations</a>, arXiv:1309.7117 [math.CO], (2013).
%e a(4)=1 since 1324 is the only length 4 permutation with 1 occurrence of the pattern 1324.
%p # Program can be obtained from authors' personal websites.
%K nonn,more
%O 1,5
%A _Brian Nakamura_, Mar 12 2014