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”).

a(n) is the number of permutations of [n] which avoid the patterns 1234, 1324, 1342, and 2413.
1

%I #26 Feb 25 2024 00:31:57

%S 1,1,2,6,20,66,214,688,2206,7070,22660,72634,232830,746352,2392486,

%T 7669286,24584436,78807122,252621702,809796400,2595858574

%N a(n) is the number of permutations of [n] which avoid the patterns 1234, 1324, 1342, and 2413.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PermutationPattern.html">Permutation Pattern</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>

%e For n = 4, the valid permutations are the 20 which are not elements of the set {1234,1324,1342,2413}, hence a(4) = 20.

%Y Cf. A033321 (avoiding 1234, 1324, 1342), A369626 (avoiding 1234, 1324, 2413), A053617 (avoiding 1234, 1324), A165530 (avoiding 1234 and 2413).

%K nonn,more

%O 0,3

%A _Matt Slattery-Holmes_, Jan 23 2024

%E a(13)-a(20) from _Martin Ehrenstein_, Feb 24 2024